./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:20:41,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:20:41,213 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:20:41,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:20:41,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:20:41,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:20:41,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:20:41,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:20:41,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:20:41,242 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:20:41,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:20:41,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:20:41,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:20:41,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:20:41,245 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:20:41,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:20:41,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:20:41,246 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:20:41,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:20:41,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:20:41,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:20:41,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:20:41,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:20:41,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:20:41,249 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:20:41,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:20:41,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:20:41,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:20:41,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:20:41,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:20:41,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:20:41,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:41,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:20:41,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:20:41,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:20:41,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:20:41,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:20:41,254 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 [2023-11-28 20:20:41,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:20:41,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:20:41,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:20:41,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:20:41,505 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:20:41,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:20:44,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:20:44,445 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:20:44,446 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:20:44,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/ac233b75c/ca5f4dcacf69430dba6b881ada986638/FLAGdbefbb85d [2023-11-28 20:20:44,470 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/ac233b75c/ca5f4dcacf69430dba6b881ada986638 [2023-11-28 20:20:44,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:20:44,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:20:44,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:44,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:20:44,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:20:44,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a092817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44, skipping insertion in model container [2023-11-28 20:20:44,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,514 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:20:44,635 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2023-11-28 20:20:44,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:44,705 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:20:44,716 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2023-11-28 20:20:44,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:44,766 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:20:44,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44 WrapperNode [2023-11-28 20:20:44,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:44,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:44,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:20:44,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:20:44,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,823 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2023-11-28 20:20:44,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:44,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:20:44,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:20:44,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:20:44,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,856 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:20:44,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:20:44,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:20:44,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:20:44,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:20:44,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:44,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:20:44,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:20:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:20:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:20:44,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:20:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:20:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:20:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:20:45,048 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:20:45,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:20:45,400 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:20:45,435 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:20:45,435 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:20:45,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45 BoogieIcfgContainer [2023-11-28 20:20:45,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:20:45,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:20:45,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:20:45,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:20:45,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:44" (1/3) ... [2023-11-28 20:20:45,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53312bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:45, skipping insertion in model container [2023-11-28 20:20:45,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44" (2/3) ... [2023-11-28 20:20:45,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53312bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:45, skipping insertion in model container [2023-11-28 20:20:45,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45" (3/3) ... [2023-11-28 20:20:45,444 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:20:45,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:20:45,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:20:45,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:20:45,512 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11630843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:20:45,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:20:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-28 20:20:45,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:45,532 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:45,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:45,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1735685552, now seen corresponding path program 1 times [2023-11-28 20:20:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:45,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664700645] [2023-11-28 20:20:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:20:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:20:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:20:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:20:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:20:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:20:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:20:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 20:20:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:20:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:20:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 20:20:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 20:20:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 20:20:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 20:20:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 20:20:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:20:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-28 20:20:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:20:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:20:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:20:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-28 20:20:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:20:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:20:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:20:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:20:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-28 20:20:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-28 20:20:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664700645] [2023-11-28 20:20:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664700645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81481025] [2023-11-28 20:20:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:45,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:20:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:20:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:20:45,994 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-28 20:20:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:20:46,038 INFO L93 Difference]: Finished difference Result 167 states and 294 transitions. [2023-11-28 20:20:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:20:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2023-11-28 20:20:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:20:46,049 INFO L225 Difference]: With dead ends: 167 [2023-11-28 20:20:46,049 INFO L226 Difference]: Without dead ends: 83 [2023-11-28 20:20:46,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-28 20:20:46,058 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:20:46,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:20:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-28 20:20:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-28 20:20:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2023-11-28 20:20:46,097 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 166 [2023-11-28 20:20:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:20:46,097 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2023-11-28 20:20:46,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-28 20:20:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2023-11-28 20:20:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-28 20:20:46,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:46,103 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:20:46,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:46,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2131316368, now seen corresponding path program 1 times [2023-11-28 20:20:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261236181] [2023-11-28 20:20:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:20:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:20:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:20:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:20:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:20:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:20:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:20:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 20:20:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:20:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:20:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 20:20:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 20:20:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 20:20:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 20:20:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 20:20:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:20:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-28 20:20:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:20:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:20:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:20:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-28 20:20:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:20:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:20:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:20:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:20:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-28 20:20:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-28 20:20:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261236181] [2023-11-28 20:20:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261236181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:46,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:20:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722772467] [2023-11-28 20:20:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:46,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:46,636 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:20:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:20:46,746 INFO L93 Difference]: Finished difference Result 170 states and 266 transitions. [2023-11-28 20:20:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:46,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2023-11-28 20:20:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:20:46,751 INFO L225 Difference]: With dead ends: 170 [2023-11-28 20:20:46,751 INFO L226 Difference]: Without dead ends: 88 [2023-11-28 20:20:46,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:46,754 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:20:46,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:20:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-28 20:20:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2023-11-28 20:20:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2023-11-28 20:20:46,785 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 167 [2023-11-28 20:20:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:20:46,787 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2023-11-28 20:20:46,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:20:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2023-11-28 20:20:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-28 20:20:46,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:46,792 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:46,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:20:46,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:46,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash -776143960, now seen corresponding path program 1 times [2023-11-28 20:20:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986994828] [2023-11-28 20:20:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:20:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:20:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:20:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:20:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:20:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:20:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:20:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 20:20:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:20:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:20:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 20:20:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 20:20:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 20:20:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 20:20:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 20:20:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:20:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-28 20:20:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:20:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:20:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:20:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-28 20:20:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:20:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:20:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:20:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:20:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-28 20:20:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-28 20:20:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986994828] [2023-11-28 20:20:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986994828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:20:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667992368] [2023-11-28 20:20:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:47,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:47,068 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:20:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:20:47,107 INFO L93 Difference]: Finished difference Result 175 states and 268 transitions. [2023-11-28 20:20:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2023-11-28 20:20:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:20:47,110 INFO L225 Difference]: With dead ends: 175 [2023-11-28 20:20:47,110 INFO L226 Difference]: Without dead ends: 90 [2023-11-28 20:20:47,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:47,113 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 115 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:20:47,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 133 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:20:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-28 20:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-28 20:20:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2023-11-28 20:20:47,132 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 168 [2023-11-28 20:20:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:20:47,133 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2023-11-28 20:20:47,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:20:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2023-11-28 20:20:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-28 20:20:47,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:47,136 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:47,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:20:47,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:47,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1349098155, now seen corresponding path program 1 times [2023-11-28 20:20:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509533398] [2023-11-28 20:20:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:20:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:20:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:20:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:20:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:20:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:20:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:20:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 20:20:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:20:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:20:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 20:20:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 20:20:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 20:20:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 20:20:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 20:20:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:20:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-28 20:20:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:20:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:20:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:20:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-28 20:20:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:20:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:20:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:20:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:20:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-28 20:20:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:20:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509533398] [2023-11-28 20:20:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509533398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:20:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145936552] [2023-11-28 20:20:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:47,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:20:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:47,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:20:47,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:20:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:20:47,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:20:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 655 proven. 30 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2023-11-28 20:20:47,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:20:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:20:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145936552] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:20:48,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:20:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-28 20:20:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594210284] [2023-11-28 20:20:48,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:20:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:20:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:20:48,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:20:48,084 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-11-28 20:20:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:20:48,951 INFO L93 Difference]: Finished difference Result 248 states and 358 transitions. [2023-11-28 20:20:48,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:20:48,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 169 [2023-11-28 20:20:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:20:48,954 INFO L225 Difference]: With dead ends: 248 [2023-11-28 20:20:48,954 INFO L226 Difference]: Without dead ends: 159 [2023-11-28 20:20:48,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:20:48,957 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 261 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:20:48,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 285 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:20:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-28 20:20:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 91. [2023-11-28 20:20:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-11-28 20:20:48,988 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 169 [2023-11-28 20:20:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:20:48,989 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-11-28 20:20:48,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-11-28 20:20:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-11-28 20:20:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-28 20:20:48,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:48,992 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:48,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:20:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:20:49,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:49,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1666005463, now seen corresponding path program 1 times [2023-11-28 20:20:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:49,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638050871] [2023-11-28 20:20:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:20:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:20:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:20:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:20:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:20:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:20:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:20:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 20:20:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:20:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:20:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-28 20:20:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 20:20:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 20:20:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-28 20:20:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-28 20:20:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:20:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-28 20:20:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:20:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-28 20:20:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:20:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-28 20:20:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:20:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:20:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:20:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:20:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-28 20:20:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:20:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638050871] [2023-11-28 20:20:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638050871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:20:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968058189] [2023-11-28 20:20:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:49,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:20:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:49,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:20:49,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:20:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:20:49,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:20:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 655 proven. 30 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2023-11-28 20:20:50,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:20:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 30 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:20:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968058189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:20:50,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:20:50,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-28 20:20:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101066153] [2023-11-28 20:20:50,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:20:50,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:20:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:20:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:20:50,314 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-11-28 20:20:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:20:51,263 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2023-11-28 20:20:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:20:51,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 169 [2023-11-28 20:20:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:20:51,267 INFO L225 Difference]: With dead ends: 249 [2023-11-28 20:20:51,267 INFO L226 Difference]: Without dead ends: 159 [2023-11-28 20:20:51,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2023-11-28 20:20:51,268 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 316 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:20:51,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 380 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:20:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-28 20:20:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 91. [2023-11-28 20:20:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:20:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2023-11-28 20:20:51,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 169 [2023-11-28 20:20:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:20:51,297 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2023-11-28 20:20:51,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-11-28 20:20:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2023-11-28 20:20:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-28 20:20:51,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:20:51,300 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:20:51,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:20:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:20:51,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:20:51,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1112385918, now seen corresponding path program 1 times [2023-11-28 20:20:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72907489] [2023-11-28 20:20:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:20:51,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:20:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:20:51,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:20:51,685 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:20:51,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:20:51,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:20:51,691 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-28 20:20:51,694 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:20:51,781 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:20:51,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:20:51,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:20:51,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:20:51,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:20:51,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-28 20:20:51,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:20:51,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated [2023-11-28 20:20:51,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:51 BoogieIcfgContainer [2023-11-28 20:20:51,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:20:51,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:20:51,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:20:51,809 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:20:51,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:45" (3/4) ... [2023-11-28 20:20:51,811 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:20:51,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:20:51,813 INFO L158 Benchmark]: Toolchain (without parser) took 7338.44ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 125.1MB in the beginning and 123.9MB in the end (delta: 1.2MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,813 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:20:51,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.35ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 111.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 161.5MB. Free memory was 111.0MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,814 INFO L158 Benchmark]: Boogie Preprocessor took 56.51ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,815 INFO L158 Benchmark]: RCFGBuilder took 553.56ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 127.9MB in the end (delta: -23.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,815 INFO L158 Benchmark]: TraceAbstraction took 6370.56ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 127.2MB in the beginning and 125.0MB in the end (delta: 2.2MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,816 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 213.9MB. Free memory was 125.0MB in the beginning and 123.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:20:51,817 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 113.2MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.35ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 111.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 161.5MB. Free memory was 111.0MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.51ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.56ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 127.9MB in the end (delta: -23.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6370.56ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 127.2MB in the beginning and 125.0MB in the end (delta: 2.2MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 213.9MB. Free memory was 125.0MB in the beginning and 123.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 153, overapproximation of bitwiseOr at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed char var_1_27 = 4; [L44] signed char var_1_28 = 0; [L45] double var_1_29 = 64.5; [L46] double var_1_30 = 9.875; [L47] unsigned short int var_1_31 = 128; [L48] unsigned short int var_1_32 = 1; [L49] unsigned char var_1_33 = 128; [L50] unsigned char var_1_34 = 10; [L51] double last_1_var_1_22 = 200.8; [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] CALL updateLastVariables() [L150] last_1_var_1_22 = var_1_22 [L160] RET updateLastVariables() [L161] CALL updateVariables() [L105] var_1_4 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L106] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L107] var_1_5 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L108] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_6=4000003/4, var_1_7=1] [L109] var_1_6 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L110] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L112] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L113] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L113] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L115] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L116] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L116] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L118] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L119] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L119] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L122] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L122] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L124] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L126] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L128] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L129] var_1_20 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L130] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L131] var_1_23 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L132] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L133] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L133] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L134] var_1_24 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L135] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L136] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L136] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=0, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L137] var_1_28 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L138] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L139] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L139] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_30=79/8, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L140] var_1_30 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L141] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=1, var_1_33=128, var_1_34=10, var_1_7=1] [L142] var_1_32 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L143] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_33=128, var_1_34=10, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L144] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=10, var_1_7=1] [L145] var_1_34 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L146] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L147] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=4, var_1_28=126, var_1_29=129/2, var_1_31=128, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L161] RET updateVariables() [L162] CALL step() [L55] var_1_26 = 0 [L56] var_1_27 = var_1_28 [L57] var_1_29 = var_1_30 [L58] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L59] COND TRUE var_1_31 >= var_1_32 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L60] COND FALSE !(((((var_1_31) > (16)) ? (var_1_31) : (16))) < var_1_32) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_7=1] [L64] COND TRUE ! (var_1_4 < 16.8f) [L65] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L67] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L68] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L68] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L68] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L68] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L68] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L69] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L77] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L80] COND FALSE !(var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) [L83] var_1_16 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000005, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L86] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000005, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L87] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L94] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L96] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L97] COND TRUE stepLocal_0 || var_1_7 [L98] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_20=1000000000005, var_1_21=1, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L100] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L101] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_20=1000000000005, var_1_21=50, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L162] RET step() [L163] CALL, EXPR property() [L153] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_20=1000000000005, var_1_21=50, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L153-L154] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_20=1000000000005, var_1_21=50, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000006, var_1_16=1000000000005, var_1_20=1000000000005, var_1_21=50, var_1_22=1000000000005, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_27=126, var_1_28=126, var_1_29=1000000000007, var_1_30=1000000000007, var_1_31=65534, var_1_32=65534, var_1_33=128, var_1_34=254, var_1_6=1000000000006, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 715 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 540 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 604 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 960 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 138 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1349 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1506 ConstructedInterpolants, 0 QuantifiedInterpolants, 3259 SizeOfPredicates, 8 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 11520/11700 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-28 20:20:51,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:20:53,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:20:53,835 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:20:53,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:20:53,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:20:53,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:20:53,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:20:53,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:20:53,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:20:53,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:20:53,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:20:53,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:20:53,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:20:53,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:20:53,886 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:20:53,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:20:53,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:20:53,887 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:20:53,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:20:53,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:20:53,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:20:53,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:20:53,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:20:53,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:20:53,891 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:20:53,891 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:20:53,892 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:20:53,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:20:53,892 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:20:53,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:20:53,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:20:53,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:20:53,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:20:53,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:53,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:20:53,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:20:53,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:20:53,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:20:53,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:20:53,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:20:53,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:20:53,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:20:53,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:20:53,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:20:53,898 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:20:53,898 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01255a2de244ad5f0e2f4316c1d9bc147d3be1eb9af8b3b357be1318db919a62 [2023-11-28 20:20:54,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:20:54,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:20:54,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:20:54,240 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:20:54,241 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:20:54,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:20:57,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:20:57,222 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:20:57,223 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:20:57,234 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/8508caa9e/08d12f0f1893402e92979683b961468d/FLAG58308ab2d [2023-11-28 20:20:57,248 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/data/8508caa9e/08d12f0f1893402e92979683b961468d [2023-11-28 20:20:57,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:20:57,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:20:57,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:57,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:20:57,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:20:57,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f1a3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57, skipping insertion in model container [2023-11-28 20:20:57,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:20:57,449 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2023-11-28 20:20:57,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:57,522 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:20:57,535 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_cbd4dbf7-d830-4962-9031-2b568bf7b382/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-75.i[915,928] [2023-11-28 20:20:57,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:57,586 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:20:57,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57 WrapperNode [2023-11-28 20:20:57,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:57,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:57,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:20:57,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:20:57,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,639 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2023-11-28 20:20:57,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:57,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:20:57,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:20:57,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:20:57,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:20:57,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:20:57,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:20:57,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:20:57,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:20:57,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (1/1) ... [2023-11-28 20:20:57,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:57,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:57,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:20:57,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:20:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:20:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:20:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:20:57,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:20:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:20:57,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:20:57,912 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:20:57,915 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:19,589 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:19,638 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:19,638 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:21:19,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:19 BoogieIcfgContainer [2023-11-28 20:21:19,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:19,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:19,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:19,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:19,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:57" (1/3) ... [2023-11-28 20:21:19,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:19, skipping insertion in model container [2023-11-28 20:21:19,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:57" (2/3) ... [2023-11-28 20:21:19,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:19, skipping insertion in model container [2023-11-28 20:21:19,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:19" (3/3) ... [2023-11-28 20:21:19,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-75.i [2023-11-28 20:21:19,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:19,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:21:19,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:19,718 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3aa4b44d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:19,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:21:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:21:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-28 20:21:19,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:19,739 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:21:19,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:19,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1990279055, now seen corresponding path program 1 times [2023-11-28 20:21:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:19,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737860188] [2023-11-28 20:21:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:19,760 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-28 20:21:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:19,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:19,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:20,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:21:20,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-11-28 20:21:20,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:21:20,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:21:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737860188] [2023-11-28 20:21:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737860188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:20,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:20,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863449990] [2023-11-28 20:21:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:21:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:21:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:21:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:21:20,687 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-28 20:21:25,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:25,104 INFO L93 Difference]: Finished difference Result 137 states and 242 transitions. [2023-11-28 20:21:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:21:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2023-11-28 20:21:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:25,209 INFO L225 Difference]: With dead ends: 137 [2023-11-28 20:21:25,209 INFO L226 Difference]: Without dead ends: 68 [2023-11-28 20:21:25,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-28 20:21:25,214 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:25,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2023-11-28 20:21:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-28 20:21:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-28 20:21:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-28 20:21:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2023-11-28 20:21:25,252 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 162 [2023-11-28 20:21:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:25,253 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2023-11-28 20:21:25,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-28 20:21:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2023-11-28 20:21:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-28 20:21:25,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:25,257 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:21:25,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:21:25,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:25,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:25,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -686398290, now seen corresponding path program 1 times [2023-11-28 20:21:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887557540] [2023-11-28 20:21:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:25,460 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-28 20:21:25,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:25,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:25,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:21:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:26,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:21:26,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-28 20:21:26,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:21:26,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:21:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887557540] [2023-11-28 20:21:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887557540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:21:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907508262] [2023-11-28 20:21:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:26,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:26,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:21:26,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:26,329 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:21:30,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:30,854 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2023-11-28 20:21:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:30,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2023-11-28 20:21:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:30,859 INFO L225 Difference]: With dead ends: 177 [2023-11-28 20:21:30,859 INFO L226 Difference]: Without dead ends: 110 [2023-11-28 20:21:30,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:30,862 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 89 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:30,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 226 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-11-28 20:21:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-28 20:21:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2023-11-28 20:21:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 59 states have internal predecessors, (67), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:21:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2023-11-28 20:21:30,890 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 163 [2023-11-28 20:21:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2023-11-28 20:21:30,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2023-11-28 20:21:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2023-11-28 20:21:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-28 20:21:30,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:30,895 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:21:30,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:21:31,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:31,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:31,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1693816071, now seen corresponding path program 1 times [2023-11-28 20:21:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556501531] [2023-11-28 20:21:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:31,100 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-28 20:21:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:31,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/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-28 20:21:31,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbd4dbf7-d830-4962-9031-2b568bf7b382/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:21:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:32,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-28 20:21:32,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:53,694 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:01,861 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:09,963 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:18,142 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:26,339 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:34,528 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:41,284 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:49,470 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:22:57,656 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:05,845 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:14,010 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:22,176 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:30,346 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:38,518 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:46,683 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:54,887 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:03,055 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:11,228 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:19,432 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:23,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse3) (fp.leq c_~var_1_6~0 .cse4)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse4)) (fp.leq c_~var_1_6~0 (fp.neg .cse3))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from false [2023-11-28 20:24:27,518 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse3) (fp.leq c_~var_1_6~0 .cse4)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse4)) (fp.leq c_~var_1_6~0 (fp.neg .cse3))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from true [2023-11-28 20:24:35,716 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:43,890 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:51,987 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:58,638 WARN L293 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:11,084 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:19,253 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:27,424 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:34,075 WARN L293 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:46,258 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:58,538 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:06,712 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:14,877 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:23,052 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:31,216 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:39,385 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:47,565 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:55,961 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:04,332 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:12,619 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:20,952 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:29,340 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:37,666 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:46,051 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:54,432 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:02,706 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:11,034 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:19,363 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:27,688 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:36,079 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:44,409 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:52,734 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:01,120 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:09,451 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:17,840 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:26,161 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:34,551 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:42,947 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:47,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse3) (fp.leq c_~var_1_6~0 .cse4)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse4)) (fp.leq c_~var_1_6~0 (fp.neg .cse3))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from false [2023-11-28 20:29:51,114 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (let ((.cse1 (= (_ bv0 8) c_~var_1_11~0)) (.cse0 (= c_~var_1_12~0 (_ bv0 8))) (.cse2 (= c_~var_1_13~0 (_ bv0 8)))) (or (and (or .cse0 .cse1 .cse2) (= c_~var_1_7~0 (_ bv0 8))) (and (not .cse1) (= (_ bv1 8) c_~var_1_7~0) (not .cse0) (not .cse2)))) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse3) (fp.leq c_~var_1_6~0 .cse4)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse4)) (fp.leq c_~var_1_6~0 (fp.neg .cse3))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from true [2023-11-28 20:29:59,456 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:07,852 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:16,165 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:24,499 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:32,904 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:41,245 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:49,648 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:58,051 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:06,347 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:14,691 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:23,052 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:31,389 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:39,803 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:48,138 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:56,471 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:04,879 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:13,216 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:21,638 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:29,968 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:38,371 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:46,790 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:55,266 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:03,643 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:11,999 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:20,380 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:28,899 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:37,369 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:45,742 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:54,142 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:02,475 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:10,978 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:19,429 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:27,877 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:36,249 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:44,717 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:53,207 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:01,717 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:10,245 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:18,712 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:27,197 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:35,585 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:43,978 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:52,500 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)