./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:45:43,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:45:43,204 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:45:43,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:45:43,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:45:43,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:45:43,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:45:43,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:45:43,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:45:43,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:45:43,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:45:43,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:45:43,240 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:45:43,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:45:43,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:45:43,242 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:45:43,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:45:43,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:45:43,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:45:43,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:45:43,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:45:43,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:45:43,246 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:45:43,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:45:43,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:45:43,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:45:43,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:45:43,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:45:43,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:43,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:45:43,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:45:43,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:45:43,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:45:43,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:45:43,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:45:43,252 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:45:43,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:45:43,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:45:43,253 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:45:43,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2023-11-06 22:45:43,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:45:43,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:45:43,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:45:43,522 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:45:43,522 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:45:43,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:45:46,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:45:47,117 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:45:47,118 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:45:47,127 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/7725576a9/423c326aed4a4ecb93c98bcdc7bfad83/FLAGd30e78ce3 [2023-11-06 22:45:47,141 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/7725576a9/423c326aed4a4ecb93c98bcdc7bfad83 [2023-11-06 22:45:47,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:45:47,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:45:47,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:47,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:45:47,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:45:47,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402ebfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47, skipping insertion in model container [2023-11-06 22:45:47,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:45:47,346 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2023-11-06 22:45:47,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:47,466 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:45:47,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2023-11-06 22:45:47,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:47,537 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:45:47,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47 WrapperNode [2023-11-06 22:45:47,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:47,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:47,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:45:47,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:45:47,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,618 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2023-11-06 22:45:47,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:47,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:45:47,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:45:47,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:45:47,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:45:47,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:45:47,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:45:47,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:45:47,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (1/1) ... [2023-11-06 22:45:47,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:47,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:47,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:45:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:45:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:45:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:45:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:45:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:45:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:45:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:45:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:45:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:45:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:45:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:45:47,923 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:45:47,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:45:48,485 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:45:48,494 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:45:48,494 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:45:48,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:48 BoogieIcfgContainer [2023-11-06 22:45:48,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:45:48,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:45:48,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:45:48,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:45:48,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:47" (1/3) ... [2023-11-06 22:45:48,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327426b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:48, skipping insertion in model container [2023-11-06 22:45:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:47" (2/3) ... [2023-11-06 22:45:48,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327426b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:48, skipping insertion in model container [2023-11-06 22:45:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:48" (3/3) ... [2023-11-06 22:45:48,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:45:48,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:45:48,562 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:45:48,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:45:48,636 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f544d88, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:45:48,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:45:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:48,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:48,659 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:48,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:48,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1229666287, now seen corresponding path program 1 times [2023-11-06 22:45:48,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:48,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707868025] [2023-11-06 22:45:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:45:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:45:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:45:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:45:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:45:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:45:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:45:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:45:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:45:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707868025] [2023-11-06 22:45:49,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707868025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:49,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:45:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446747663] [2023-11-06 22:45:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:49,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:45:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:45:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:45:49,467 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:45:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:49,549 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2023-11-06 22:45:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:49,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2023-11-06 22:45:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:49,562 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:45:49,562 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:45:49,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:49,570 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:49,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 456 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:45:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2023-11-06 22:45:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-11-06 22:45:49,646 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2023-11-06 22:45:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:49,647 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-11-06 22:45:49,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:45:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-11-06 22:45:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:49,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:49,652 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:45:49,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:49,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 668966509, now seen corresponding path program 1 times [2023-11-06 22:45:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057075006] [2023-11-06 22:45:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:45:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:45:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:45:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:45:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:45:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:45:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:45:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:45:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:45:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057075006] [2023-11-06 22:45:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057075006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:50,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:50,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943630324] [2023-11-06 22:45:50,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:50,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:45:50,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:50,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:50,101 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:50,206 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2023-11-06 22:45:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:45:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:45:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:50,215 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:45:50,216 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:45:50,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:45:50,219 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 72 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:50,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 648 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:45:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2023-11-06 22:45:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2023-11-06 22:45:50,233 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2023-11-06 22:45:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:50,234 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2023-11-06 22:45:50,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2023-11-06 22:45:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:50,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:50,238 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:50,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:45:50,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:50,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2043589665, now seen corresponding path program 1 times [2023-11-06 22:45:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100815646] [2023-11-06 22:45:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:45:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:45:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:45:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:45:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:45:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:45:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:45:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:45:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:45:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100815646] [2023-11-06 22:45:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100815646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:45:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526056608] [2023-11-06 22:45:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:50,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:45:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:45:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:45:50,541 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:50,591 INFO L93 Difference]: Finished difference Result 237 states and 338 transitions. [2023-11-06 22:45:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:50,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:45:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:50,594 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:45:50,597 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:45:50,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:50,599 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 21 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:50,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 458 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:45:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2023-11-06 22:45:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2023-11-06 22:45:50,614 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 112 [2023-11-06 22:45:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:50,615 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2023-11-06 22:45:50,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2023-11-06 22:45:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:50,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:50,619 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:50,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:45:50,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:50,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1363531295, now seen corresponding path program 1 times [2023-11-06 22:45:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773972315] [2023-11-06 22:45:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:45:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:45:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:45:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:45:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:45:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:45:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:45:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:45:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:45:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773972315] [2023-11-06 22:45:50,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773972315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:50,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:45:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173796378] [2023-11-06 22:45:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:50,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:45:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:45:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:45:50,807 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:50,850 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2023-11-06 22:45:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:45:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:50,856 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:45:50,857 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:45:50,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:50,869 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:50,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 456 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:45:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2023-11-06 22:45:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2023-11-06 22:45:50,892 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 112 [2023-11-06 22:45:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:50,893 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2023-11-06 22:45:50,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2023-11-06 22:45:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:50,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:50,898 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:50,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:45:50,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:50,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 411476067, now seen corresponding path program 1 times [2023-11-06 22:45:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092083514] [2023-11-06 22:45:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:45:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:45:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:45:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:45:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:45:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:45:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:45:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:45:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:45:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092083514] [2023-11-06 22:45:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092083514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:51,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:51,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266501756] [2023-11-06 22:45:51,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:51,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:45:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:51,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:51,146 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:51,203 INFO L93 Difference]: Finished difference Result 240 states and 338 transitions. [2023-11-06 22:45:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:45:51,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:45:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:51,207 INFO L225 Difference]: With dead ends: 240 [2023-11-06 22:45:51,207 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 22:45:51,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:45:51,211 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 9 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:51,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 601 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 22:45:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-11-06 22:45:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:45:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2023-11-06 22:45:51,242 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2023-11-06 22:45:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:51,243 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2023-11-06 22:45:51,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:45:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2023-11-06 22:45:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:45:51,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:51,247 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:45:51,248 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:51,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 413323109, now seen corresponding path program 1 times [2023-11-06 22:45:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487583855] [2023-11-06 22:45:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:51,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:51,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:51,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:45:51,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:45:51,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:45:51,530 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:45:51,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:45:51,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:45:51 BoogieIcfgContainer [2023-11-06 22:45:51,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:45:51,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:45:51,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:45:51,642 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:45:51,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:48" (3/4) ... [2023-11-06 22:45:51,645 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:45:51,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:45:51,647 INFO L158 Benchmark]: Toolchain (without parser) took 4501.72ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 122.9MB in the beginning and 74.5MB in the end (delta: 48.3MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,647 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:51,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 108.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.94ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 104.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,648 INFO L158 Benchmark]: Boogie Preprocessor took 110.38ms. Allocated memory is still 153.1MB. Free memory was 104.7MB in the beginning and 101.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,649 INFO L158 Benchmark]: RCFGBuilder took 766.11ms. Allocated memory is still 153.1MB. Free memory was 101.5MB in the beginning and 121.1MB in the end (delta: -19.6MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,649 INFO L158 Benchmark]: TraceAbstraction took 3142.63ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 120.4MB in the beginning and 74.5MB in the end (delta: 45.9MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2023-11-06 22:45:51,649 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 188.7MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:51,651 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.23ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 108.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.94ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 104.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.38ms. Allocated memory is still 153.1MB. Free memory was 104.7MB in the beginning and 101.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 766.11ms. Allocated memory is still 153.1MB. Free memory was 101.5MB in the beginning and 121.1MB in the end (delta: -19.6MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3142.63ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 120.4MB in the beginning and 74.5MB in the end (delta: 45.9MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 188.7MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someUnaryFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L40] double last_1_double_Array_0_1_ = 100.5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR double_Array_0[1] [L89] last_1_double_Array_0_1_ = double_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1000000007, double_Array_0[0]=1000000007, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [(double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1000000007, double_Array_0[0]=1000000007, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [(double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1000000007, double_Array_0[0]=1000000007, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[2] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2]=1000000006, double_Array_0[2]=1000000006, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [(double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F=1, double_Array_0[2]=1000000006, double_Array_0[2]=1000000006, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [(double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F=1, double_Array_0[2]=1000000006, double_Array_0[2]=1000000006, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3]=1000000001, double_Array_0[3]=1000000001, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [(double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F=1, double_Array_0[3]=1000000001, double_Array_0[3]=1000000001, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [(double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F=1, double_Array_0[3]=1000000001, double_Array_0[3]=1000000001, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4]=1000000002, double_Array_0[4]=1000000002, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [(double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F=1, double_Array_0[4]=1000000002, double_Array_0[4]=1000000002, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [(double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F=1, double_Array_0[4]=1000000002, double_Array_0[4]=1000000002, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [(float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F=1, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [(float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F=1, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_char_Array_0[1]=-127, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_char_Array_0[1]=-127, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_char_Array_0[1]=-127, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_char_Array_0[1]=-127, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] unsigned_short_int_Array_0[2] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[2]=65534] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[2]=65534] [L86] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[2]=65534] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[2]=65534] [L100] RET updateVariables() [L101] CALL step() [L44] COND TRUE 0.625f > last_1_double_Array_0_1_ [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] [L51] signed_char_Array_0[0] = signed_char_Array_0[1] [L52] EXPR unsigned_short_int_Array_0[2] [L52] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[2] [L53] EXPR unsigned_short_int_Array_0[2] [L53] unsigned_short_int_Array_0[0] = unsigned_short_int_Array_0[2] [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L59] EXPR float_Array_0[1] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[1]=10000000001/10, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND TRUE float_Array_0[1] <= float_Array_0[1] [L60] EXPR double_Array_0[2] [L60] EXPR double_Array_0[3] [L60] EXPR double_Array_0[4] [L60] double_Array_0[1] = (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])) [L63] EXPR float_Array_0[0] [L63] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=1000000005, float_Array_0={6:0}, float_Array_0[0]=1000000010, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(float_Array_0[0] > double_Array_0[1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) [L92] EXPR float_Array_0[1] [L92] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L92] EXPR float_Array_0[0] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) VAL [(0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)=0, (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [(((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))=0, ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)=0, (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))=0, (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))=0, ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)=0, (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [(((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))=0, ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))=0, (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))=0, ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)=0, (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2]))=0, (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))=0, ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))=0, (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))=0, ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)=0, (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))=0, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000000010, float_Array_0[0]=1000000010, float_Array_0[1]=10000000001/10, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92-L93] return ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 2619 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1824 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 795 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1100/1100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:45:51,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:45:54,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:45:54,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:45:54,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:45:54,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:45:54,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:45:54,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:45:54,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:45:54,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:45:54,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:45:54,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:45:54,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:45:54,591 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:45:54,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:45:54,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:45:54,594 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:45:54,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:45:54,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:45:54,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:45:54,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:45:54,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:45:54,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:45:54,597 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:45:54,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:45:54,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:45:54,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:45:54,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:45:54,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:45:54,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:45:54,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:45:54,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:54,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:45:54,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:45:54,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:45:54,602 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:45:54,602 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:45:54,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:45:54,603 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:45:54,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:45:54,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:45:54,604 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:45:54,605 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:45:54,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2023-11-06 22:45:54,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:45:55,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:45:55,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:45:55,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:45:55,030 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:45:55,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:45:58,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:45:58,621 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:45:58,622 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:45:58,632 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/8872edb75/8d09fb9e0afb457091a1a93fa0f74e91/FLAG7302e615a [2023-11-06 22:45:58,655 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/data/8872edb75/8d09fb9e0afb457091a1a93fa0f74e91 [2023-11-06 22:45:58,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:45:58,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:45:58,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:58,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:45:58,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:45:58,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:58" (1/1) ... [2023-11-06 22:45:58,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a754092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:58, skipping insertion in model container [2023-11-06 22:45:58,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:58" (1/1) ... [2023-11-06 22:45:58,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:45:58,912 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2023-11-06 22:45:58,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:59,025 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:45:59,042 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i[916,929] [2023-11-06 22:45:59,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:59,156 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:45:59,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59 WrapperNode [2023-11-06 22:45:59,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:59,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:59,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:45:59,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:45:59,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,251 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2023-11-06 22:45:59,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:59,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:45:59,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:45:59,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:45:59,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:45:59,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:45:59,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:45:59,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:45:59,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (1/1) ... [2023-11-06 22:45:59,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:59,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:59,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:59,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:45:59,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:45:59,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:45:59,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:45:59,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:45:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:45:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:45:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:45:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:45:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:45:59,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:45:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:45:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:45:59,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:45:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:45:59,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:45:59,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:45:59,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:45:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:45:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:45:59,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:45:59,641 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:45:59,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:02,566 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:02,574 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:02,574 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:46:02,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:02 BoogieIcfgContainer [2023-11-06 22:46:02,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:02,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:02,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:02,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:02,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:58" (1/3) ... [2023-11-06 22:46:02,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4439bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:02, skipping insertion in model container [2023-11-06 22:46:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:59" (2/3) ... [2023-11-06 22:46:02,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4439bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:02, skipping insertion in model container [2023-11-06 22:46:02,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:02" (3/3) ... [2023-11-06 22:46:02,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2023-11-06 22:46:02,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:02,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:46:02,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:02,682 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61e8ba95, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:02,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:46:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:46:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:46:02,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:02,709 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:02,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:02,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1938011596, now seen corresponding path program 1 times [2023-11-06 22:46:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:46:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975594930] [2023-11-06 22:46:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:02,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:46:02,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:46:02,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:46:02,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:46:03,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:46:03,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 139 [2023-11-06 22:46:03,145 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:46:03,150 INFO L158 Benchmark]: Toolchain (without parser) took 4488.48ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 59.7MB in the end (delta: 27.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,151 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 56.0MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:03,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.92ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 71.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.13ms. Allocated memory is still 111.1MB. Free memory was 71.1MB in the beginning and 67.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,153 INFO L158 Benchmark]: Boogie Preprocessor took 70.65ms. Allocated memory is still 111.1MB. Free memory was 67.5MB in the beginning and 63.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,153 INFO L158 Benchmark]: RCFGBuilder took 3243.44ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 84.3MB in the end (delta: -20.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,154 INFO L158 Benchmark]: TraceAbstraction took 570.02ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 59.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:03,158 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.29ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 56.0MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.92ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 71.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.13ms. Allocated memory is still 111.1MB. Free memory was 71.1MB in the beginning and 67.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.65ms. Allocated memory is still 111.1MB. Free memory was 67.5MB in the beginning and 63.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3243.44ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 84.3MB in the end (delta: -20.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 570.02ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 59.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:46:03,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfe90239-0b2d-475a-9afb-f1faee26bf53/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.