./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:32,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:32,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:10:32,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:32,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:32,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:32,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:32,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:32,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:32,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:32,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:32,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:32,998 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:33,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:33,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:10:33,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:10:33,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:10:33,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:10:33,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:33,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:10:33,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:33,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:10:33,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:10:33,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:10:33,006 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:33,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:33,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:33,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:33,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:33,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:33,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:33,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:10:33,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:10:33,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:10:33,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:33,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:10:33,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:33,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:33,014 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:33,014 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 -> 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 [2023-11-06 23:10:33,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:33,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:33,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:33,416 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:33,417 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:33,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:36,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:36,841 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:36,842 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:36,858 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/23b7ae9f8/108d9d39c5ca4f5db28c24a6b83424a9/FLAG329904bb8 [2023-11-06 23:10:36,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/23b7ae9f8/108d9d39c5ca4f5db28c24a6b83424a9 [2023-11-06 23:10:36,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:36,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:36,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:36,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:36,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:36,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:36" (1/1) ... [2023-11-06 23:10:36,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed1e8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:36, skipping insertion in model container [2023-11-06 23:10:36,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:36" (1/1) ... [2023-11-06 23:10:36,928 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:37,124 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2023-11-06 23:10:37,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:37,249 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:37,268 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2023-11-06 23:10:37,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:37,373 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:37,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37 WrapperNode [2023-11-06 23:10:37,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:37,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:37,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:37,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:37,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,472 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2023-11-06 23:10:37,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:37,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:37,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:37,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:37,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:37,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:37,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:37,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:37,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:37,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:37,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:37,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:10:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 23:10:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 23:10:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:10:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 23:10:37,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:10:37,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:10:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:10:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:37,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:37,743 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:37,746 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:38,323 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:38,331 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:38,331 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:10:38,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38 BoogieIcfgContainer [2023-11-06 23:10:38,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:38,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:38,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:38,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:38,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:36" (1/3) ... [2023-11-06 23:10:38,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fcd2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:38, skipping insertion in model container [2023-11-06 23:10:38,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37" (2/3) ... [2023-11-06 23:10:38,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fcd2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:38, skipping insertion in model container [2023-11-06 23:10:38,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38" (3/3) ... [2023-11-06 23:10:38,344 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:38,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:38,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:10:38,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:38,430 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;@7b4cbebc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:38,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:10:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 91 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 23:10:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:38,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,455 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:38,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:38,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1848806888, now seen corresponding path program 1 times [2023-11-06 23:10:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727156151] [2023-11-06 23:10:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:10:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727156151] [2023-11-06 23:10:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727156151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:38,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792745933] [2023-11-06 23:10:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:38,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:10:38,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:10:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:10:38,947 INFO L87 Difference]: Start difference. First operand has 107 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 91 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:38,985 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2023-11-06 23:10:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:10:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-11-06 23:10:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:38,998 INFO L225 Difference]: With dead ends: 207 [2023-11-06 23:10:38,998 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 23:10:39,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:10:39,006 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:39,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 23:10:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-06 23:10:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 23:10:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-11-06 23:10:39,073 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 125 [2023-11-06 23:10:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:39,074 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-11-06 23:10:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-11-06 23:10:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:39,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:39,079 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:10:39,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:39,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1903438576, now seen corresponding path program 1 times [2023-11-06 23:10:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949961714] [2023-11-06 23:10:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:10:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:39,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949961714] [2023-11-06 23:10:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949961714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659238932] [2023-11-06 23:10:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:39,559 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:39,675 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2023-11-06 23:10:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-11-06 23:10:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:39,680 INFO L225 Difference]: With dead ends: 209 [2023-11-06 23:10:39,680 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 23:10:39,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 23:10:39,684 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 435 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 23:10:39,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 435 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 23:10:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2023-11-06 23:10:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 23:10:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2023-11-06 23:10:39,719 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 125 [2023-11-06 23:10:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:39,721 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2023-11-06 23:10:39,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2023-11-06 23:10:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:39,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:39,730 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:39,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:39,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:39,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash -524820046, now seen corresponding path program 1 times [2023-11-06 23:10:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780345340] [2023-11-06 23:10:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:10:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780345340] [2023-11-06 23:10:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780345340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677190851] [2023-11-06 23:10:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:40,107 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 23:10:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,150 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2023-11-06 23:10:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2023-11-06 23:10:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,153 INFO L225 Difference]: With dead ends: 215 [2023-11-06 23:10:40,153 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 23:10:40,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 23:10:40,156 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 12 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 434 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 23:10:40,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 434 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 23:10:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-11-06 23:10:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 23:10:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-11-06 23:10:40,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 125 [2023-11-06 23:10:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,170 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-11-06 23:10:40,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 23:10:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-11-06 23:10:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:40,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,173 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:40,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:40,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:40,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1250187316, now seen corresponding path program 1 times [2023-11-06 23:10:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135371060] [2023-11-06 23:10:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:10:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135371060] [2023-11-06 23:10:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135371060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107390432] [2023-11-06 23:10:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:41,580 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,175 INFO L93 Difference]: Finished difference Result 288 states and 415 transitions. [2023-11-06 23:10:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-11-06 23:10:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,179 INFO L225 Difference]: With dead ends: 288 [2023-11-06 23:10:42,180 INFO L226 Difference]: Without dead ends: 184 [2023-11-06 23:10:42,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:42,183 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 98 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 590 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:10:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-06 23:10:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-11-06 23:10:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 162 states have internal predecessors, (227), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 23:10:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 261 transitions. [2023-11-06 23:10:42,203 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 261 transitions. Word has length 125 [2023-11-06 23:10:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,204 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 261 transitions. [2023-11-06 23:10:42,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 261 transitions. [2023-11-06 23:10:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:42,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,207 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:42,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:42,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:42,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1390735926, now seen corresponding path program 1 times [2023-11-06 23:10:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844478562] [2023-11-06 23:10:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:10:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844478562] [2023-11-06 23:10:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844478562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391247978] [2023-11-06 23:10:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:43,640 INFO L87 Difference]: Start difference. First operand 181 states and 261 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,246 INFO L93 Difference]: Finished difference Result 513 states and 742 transitions. [2023-11-06 23:10:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:44,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-11-06 23:10:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,251 INFO L225 Difference]: With dead ends: 513 [2023-11-06 23:10:44,252 INFO L226 Difference]: Without dead ends: 335 [2023-11-06 23:10:44,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:44,261 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 195 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 564 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:10:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-06 23:10:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 196. [2023-11-06 23:10:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 176 states have (on average 1.4204545454545454) internal successors, (250), 177 states have internal predecessors, (250), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 23:10:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2023-11-06 23:10:44,291 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 125 [2023-11-06 23:10:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,291 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2023-11-06 23:10:44,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2023-11-06 23:10:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:44,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:44,294 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:44,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:44,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:44,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 379618676, now seen corresponding path program 1 times [2023-11-06 23:10:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710520730] [2023-11-06 23:10:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:10:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:10:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:10:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:10:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:10:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 23:10:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 23:10:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:10:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 23:10:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 23:10:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:10:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:10:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:10:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:10:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-06 23:10:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710520730] [2023-11-06 23:10:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710520730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642903064] [2023-11-06 23:10:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:45,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:45,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:10:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 23:10:45,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:45,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-06 23:10:45,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2023-11-06 23:10:45,858 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:10:45,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 61 [2023-11-06 23:10:46,248 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:10:46,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 29 [2023-11-06 23:10:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-06 23:10:46,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:10:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642903064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:10:46,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 15 [2023-11-06 23:10:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304251820] [2023-11-06 23:10:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:46,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 23:10:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 23:10:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:10:46,292 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:48,271 INFO L93 Difference]: Finished difference Result 609 states and 874 transitions. [2023-11-06 23:10:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:10:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-11-06 23:10:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:48,276 INFO L225 Difference]: With dead ends: 609 [2023-11-06 23:10:48,276 INFO L226 Difference]: Without dead ends: 416 [2023-11-06 23:10:48,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2023-11-06 23:10:48,278 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:48,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 599 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:10:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-11-06 23:10:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 402. [2023-11-06 23:10:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 356 states have (on average 1.404494382022472) internal successors, (500), 360 states have internal predecessors, (500), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-06 23:10:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 576 transitions. [2023-11-06 23:10:48,338 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 576 transitions. Word has length 125 [2023-11-06 23:10:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:48,339 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 576 transitions. [2023-11-06 23:10:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:10:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 576 transitions. [2023-11-06 23:10:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:10:48,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:48,347 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:48,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:10:48,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:48,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:48,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1309325066, now seen corresponding path program 1 times [2023-11-06 23:10:48,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:48,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502491727] [2023-11-06 23:10:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:48,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:10:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:48,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:10:48,742 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:10:48,744 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:10:48,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:48,750 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:48,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:10:48,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:10:48 BoogieIcfgContainer [2023-11-06 23:10:48,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:10:48,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:10:48,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:10:48,856 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:10:48,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38" (3/4) ... [2023-11-06 23:10:48,859 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:10:48,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:10:48,861 INFO L158 Benchmark]: Toolchain (without parser) took 11980.51ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 124.1MB in the beginning and 160.4MB in the end (delta: -36.3MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,861 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:48,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.29ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 108.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.04ms. Allocated memory is still 169.9MB. Free memory was 108.3MB in the beginning and 104.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,862 INFO L158 Benchmark]: Boogie Preprocessor took 60.31ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 101.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,862 INFO L158 Benchmark]: RCFGBuilder took 799.89ms. Allocated memory is still 169.9MB. Free memory was 101.3MB in the beginning and 121.0MB in the end (delta: -19.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,863 INFO L158 Benchmark]: TraceAbstraction took 10518.63ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 120.5MB in the beginning and 160.4MB in the end (delta: -39.9MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,863 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 297.8MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:48,865 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.29ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 108.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.04ms. Allocated memory is still 169.9MB. Free memory was 108.3MB in the beginning and 104.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.31ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 101.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 799.89ms. Allocated memory is still 169.9MB. Free memory was 101.3MB in the beginning and 121.0MB in the end (delta: -19.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10518.63ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 120.5MB in the beginning and 160.4MB in the end (delta: -39.9MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 297.8MB. Free memory is still 160.4MB. 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 115. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L53] unsigned long int last_1_WrapperStruct00_var_1_12 = 16; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_12=16] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_12 [L112] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_2=100000014, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )=1, WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F=1, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_2=100000014, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )=1, WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F=1, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_2=100000014, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_3=100000017, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_3=100000017, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_3=100000017, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L92] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_4 [L93] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_4 [L93] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_4=100000015, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )=1, WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F=1, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_4=100000015, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )=1, WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F=1, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_4=100000015, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L94] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-768, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00.var_1_7=-768, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-768, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00.var_1_7=-768, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_long() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00.var_1_11=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00.var_1_11=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00.var_1_13=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L123] RET updateVariables() [L124] CALL step() [L57] EXPR WrapperStruct00.var_1_2 [L57] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L57] COND FALSE !(WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) [L60] WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L60] COND FALSE !(WrapperStruct00.var_1_5) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_13 [L66] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_7 [L67] unsigned char stepLocal_0 = WrapperStruct00.var_1_7; [L68] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_0=0] [L68] COND FALSE !(WrapperStruct00.var_1_5 || stepLocal_0) [L71] EXPR WrapperStruct00.var_1_10 [L71] EXPR WrapperStruct00.var_1_11 [L71] WrapperStruct00.var_1_6 = ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4) [L73] EXPR WrapperStruct00.var_1_11 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_11; [L74] EXPR WrapperStruct00.var_1_16 [L74] EXPR WrapperStruct00.var_1_11 [L74] signed long int stepLocal_2 = WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11; [L75] EXPR WrapperStruct00.var_1_11 [L75] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_11=0, WrapperStruct00.var_1_16=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_0=0, stepLocal_2=1, stepLocal_3=0] [L75] EXPR WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16=0, WrapperStruct00.var_1_11=0, WrapperStruct00.var_1_16=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_0=0, stepLocal_2=1, stepLocal_3=0] [L75] signed long int stepLocal_1 = WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16; [L76] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0] [L76] EXPR ((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10) [L76] EXPR WrapperStruct00.var_1_10 [L76] EXPR ((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10) VAL [((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)=0, WrapperStruct00.var_1_10=0, WrapperStruct00.var_1_10=0, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0] [L76] COND FALSE !(stepLocal_1 != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) [L85] EXPR WrapperStruct00.var_1_16 [L85] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR WrapperStruct00.var_1_2 [L115] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))) [L115] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) [L115] EXPR WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) VAL [WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))) VAL [(WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))=0, WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4)))) VAL [((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))=0, (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))=0, WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1) VAL [(((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)=0, ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))=0, (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))=0, WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))=0, (((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)=0, ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))=0, (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))=0, WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13)) VAL [(((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13))=0, ((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))=0, (((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)=0, ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))=0, (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))=0, WrapperStruct00.var_1_1=100000015, WrapperStruct00.var_1_2=100000014, WrapperStruct00.var_1_3=100000017, WrapperStruct00.var_1_4=100000015, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))=0, WrapperStruct00.var_1_5=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115-L116] return (((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 640 mSDsluCounter, 2772 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1937 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1911 IncrementalHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 835 mSDtfsCounter, 1911 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 166 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 1698 SizeOfPredicates, 10 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2530/2548 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 23:10:48,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:52,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:52,271 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 23:10:52,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:52,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:52,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:52,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:52,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:52,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:52,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:52,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:52,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:52,348 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:52,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:52,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:10:52,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:10:52,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:10:52,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:52,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:10:52,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:52,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:10:52,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:10:52,357 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:10:52,357 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:10:52,358 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:10:52,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:10:52,359 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:52,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:52,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:52,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:52,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:52,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:52,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:52,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:10:52,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:10:52,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:10:52,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:52,365 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:10:52,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:52,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:52,367 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:10:52,368 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:52,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 -> 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 [2023-11-06 23:10:52,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:52,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:52,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:52,890 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:52,891 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:52,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:56,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:56,979 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:56,979 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:56,992 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/dcc67ec0d/c7159e52461345719a1b22cbfff1cc9c/FLAGb868dce9a [2023-11-06 23:10:57,021 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/data/dcc67ec0d/c7159e52461345719a1b22cbfff1cc9c [2023-11-06 23:10:57,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:57,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:57,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:57,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:57,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:57,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d152f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57, skipping insertion in model container [2023-11-06 23:10:57,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:57,339 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2023-11-06 23:10:57,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:57,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:57,506 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2023-11-06 23:10:57,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:57,642 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:57,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57 WrapperNode [2023-11-06 23:10:57,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:57,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:57,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:57,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:57,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,763 INFO L138 Inliner]: procedures = 36, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2023-11-06 23:10:57,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:57,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:57,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:57,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:57,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:57,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:57,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:57,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:57,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:58,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:58,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 23:10:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 23:10:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:10:58,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 23:10:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 23:10:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 23:10:58,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 23:10:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 23:10:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 23:10:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:10:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:10:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:58,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 23:10:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 23:10:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:10:58,255 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:58,258 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:59,287 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:59,297 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:59,297 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:10:59,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:59 BoogieIcfgContainer [2023-11-06 23:10:59,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:59,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:59,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:59,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:59,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:57" (1/3) ... [2023-11-06 23:10:59,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ab41a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:59, skipping insertion in model container [2023-11-06 23:10:59,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57" (2/3) ... [2023-11-06 23:10:59,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ab41a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:59, skipping insertion in model container [2023-11-06 23:10:59,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:59" (3/3) ... [2023-11-06 23:10:59,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-1.i [2023-11-06 23:10:59,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:59,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:10:59,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:59,426 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;@6d7d6e26, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:59,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:10:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 23:10:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 23:10:59,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:59,454 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:10:59,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:59,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash 504420253, now seen corresponding path program 1 times [2023-11-06 23:10:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:10:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110040048] [2023-11-06 23:10:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:59,483 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 23:10:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:10:59,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 23:10:59,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 23:10:59,863 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 23:10:59,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 23:11:00,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 23:11:00,065 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 23:11:00,070 INFO L158 Benchmark]: Toolchain (without parser) took 3039.08ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 42.3MB in the end (delta: 21.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-11-06 23:11:00,071 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:00,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.66ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 47.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:11:00,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.65ms. Allocated memory is still 88.1MB. Free memory was 46.7MB in the beginning and 43.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:00,073 INFO L158 Benchmark]: Boogie Preprocessor took 189.38ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 63.9MB in the end (delta: -20.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-11-06 23:11:00,074 INFO L158 Benchmark]: RCFGBuilder took 1342.74ms. Allocated memory is still 88.1MB. Free memory was 63.9MB in the beginning and 32.0MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 23:11:00,075 INFO L158 Benchmark]: TraceAbstraction took 764.80ms. Allocated memory is still 88.1MB. Free memory was 31.6MB in the beginning and 42.3MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:00,079 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.26ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.66ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 47.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.65ms. Allocated memory is still 88.1MB. Free memory was 46.7MB in the beginning and 43.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.38ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 63.9MB in the end (delta: -20.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1342.74ms. Allocated memory is still 88.1MB. Free memory was 63.9MB in the beginning and 32.0MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 764.80ms. Allocated memory is still 88.1MB. Free memory was 31.6MB in the beginning and 42.3MB in the end (delta: -10.7MB). There was no memory consumed. 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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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 23:11:00,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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_e42d04cb-92cf-477e-9f37-a43ea82c5c04/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.