./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd --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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:41:35,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:41:35,947 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:41:35,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:41:35,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:41:35,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:41:35,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:41:35,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:41:35,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:41:35,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:41:35,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:41:35,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:41:35,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:41:35,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:41:35,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:41:35,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:41:35,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:41:35,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:41:35,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:41:35,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:41:35,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:41:35,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:41:35,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:41:35,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:41:35,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:41:35,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:41:35,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:41:35,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:41:35,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:41:35,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:41:35,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2024-11-13 13:41:36,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:41:36,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:41:36,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:41:36,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:41:36,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:41:36,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i Unable to find full path for "g++" [2024-11-13 13:41:38,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:41:38,689 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:41:38,690 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-13 13:41:38,705 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/cb1114ba0/c63cbce6c7324ba79f1457c295715c5a/FLAGd8a2e7e8f [2024-11-13 13:41:38,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/cb1114ba0/c63cbce6c7324ba79f1457c295715c5a [2024-11-13 13:41:38,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:41:38,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:41:38,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:38,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:41:38,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:41:38,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:38" (1/1) ... [2024-11-13 13:41:38,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642abd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:38, skipping insertion in model container [2024-11-13 13:41:38,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:38" (1/1) ... [2024-11-13 13:41:38,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:41:38,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2024-11-13 13:41:39,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:39,132 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:41:39,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2024-11-13 13:41:39,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:39,222 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:41:39,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39 WrapperNode [2024-11-13 13:41:39,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:39,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:39,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:41:39,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:41:39,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,340 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-13 13:41:39,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:39,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:41:39,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:41:39,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:41:39,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,409 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]. [2024-11-13 13:41:39,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:41:39,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:41:39,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:41:39,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:41:39,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (1/1) ... [2024-11-13 13:41:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:41:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:39,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:39,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:41:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:41:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:41:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:41:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:41:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:41:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:41:39,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:41:39,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:41:40,368 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 13:41:40,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:41:40,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:41:40,391 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:41:40,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:41:40 BoogieIcfgContainer [2024-11-13 13:41:40,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:41:40,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:41:40,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:41:40,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:41:40,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:41:38" (1/3) ... [2024-11-13 13:41:40,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5351767a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:41:40, skipping insertion in model container [2024-11-13 13:41:40,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:39" (2/3) ... [2024-11-13 13:41:40,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5351767a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:41:40, skipping insertion in model container [2024-11-13 13:41:40,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:41:40" (3/3) ... [2024-11-13 13:41:40,421 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-13 13:41:40,441 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:41:40,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:41:40,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:41:40,526 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18be4aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:41:40,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:41:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:41:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 13:41:40,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:40,550 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:40,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1136181017, now seen corresponding path program 1 times [2024-11-13 13:41:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791372897] [2024-11-13 13:41:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791372897] [2024-11-13 13:41:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791372897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:41:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236252848] [2024-11-13 13:41:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:41,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:41:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:41:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:41:41,211 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-13 13:41:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:41,267 INFO L93 Difference]: Finished difference Result 183 states and 321 transitions. [2024-11-13 13:41:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:41:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-13 13:41:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:41,281 INFO L225 Difference]: With dead ends: 183 [2024-11-13 13:41:41,282 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 13:41:41,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:41:41,293 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:41,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:41:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 13:41:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 13:41:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:41:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-13 13:41:41,365 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 190 [2024-11-13 13:41:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-13 13:41:41,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-13 13:41:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-13 13:41:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 13:41:41,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:41,376 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:41,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:41:41,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:41,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash 859406303, now seen corresponding path program 1 times [2024-11-13 13:41:41,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:41,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80901208] [2024-11-13 13:41:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80901208] [2024-11-13 13:41:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80901208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:42,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:41:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145547639] [2024-11-13 13:41:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:42,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:41:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:41:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:41:42,659 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:42,793 INFO L93 Difference]: Finished difference Result 267 states and 420 transitions. [2024-11-13 13:41:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:41:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-13 13:41:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:42,798 INFO L225 Difference]: With dead ends: 267 [2024-11-13 13:41:42,799 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 13:41:42,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:41:42,801 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 82 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:42,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:41:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 13:41:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-13 13:41:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:41:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 275 transitions. [2024-11-13 13:41:42,878 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 275 transitions. Word has length 190 [2024-11-13 13:41:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:42,881 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 275 transitions. [2024-11-13 13:41:42,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 275 transitions. [2024-11-13 13:41:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 13:41:42,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:42,889 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:41:42,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:42,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2035902559, now seen corresponding path program 1 times [2024-11-13 13:41:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302975194] [2024-11-13 13:41:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302975194] [2024-11-13 13:41:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302975194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:41:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541447664] [2024-11-13 13:41:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:43,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:41:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:41:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:41:43,303 INFO L87 Difference]: Start difference. First operand 177 states and 275 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:43,513 INFO L93 Difference]: Finished difference Result 439 states and 686 transitions. [2024-11-13 13:41:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:41:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-13 13:41:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:43,523 INFO L225 Difference]: With dead ends: 439 [2024-11-13 13:41:43,523 INFO L226 Difference]: Without dead ends: 351 [2024-11-13 13:41:43,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:41:43,531 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 137 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:43,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 466 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:41:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-13 13:41:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 183. [2024-11-13 13:41:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:41:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 282 transitions. [2024-11-13 13:41:43,621 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 282 transitions. Word has length 190 [2024-11-13 13:41:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:43,622 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 282 transitions. [2024-11-13 13:41:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 282 transitions. [2024-11-13 13:41:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 13:41:43,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:43,629 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:41:43,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1836362911, now seen corresponding path program 1 times [2024-11-13 13:41:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426498486] [2024-11-13 13:41:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426498486] [2024-11-13 13:41:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426498486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:43,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:43,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:41:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827186750] [2024-11-13 13:41:43,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:43,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:41:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:41:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:41:43,940 INFO L87 Difference]: Start difference. First operand 183 states and 282 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:44,009 INFO L93 Difference]: Finished difference Result 271 states and 415 transitions. [2024-11-13 13:41:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:41:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-13 13:41:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:44,012 INFO L225 Difference]: With dead ends: 271 [2024-11-13 13:41:44,012 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 13:41:44,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:41:44,016 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:44,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:41:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 13:41:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 13:41:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:41:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-11-13 13:41:44,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 190 [2024-11-13 13:41:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:44,050 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-11-13 13:41:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-11-13 13:41:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 13:41:44,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:44,057 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:41:44,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:44,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash -275512252, now seen corresponding path program 1 times [2024-11-13 13:41:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838835774] [2024-11-13 13:41:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838835774] [2024-11-13 13:41:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838835774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:44,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:41:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131016396] [2024-11-13 13:41:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:41:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:41:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:41:44,539 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:44,618 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2024-11-13 13:41:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:41:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-13 13:41:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:44,623 INFO L225 Difference]: With dead ends: 179 [2024-11-13 13:41:44,623 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 13:41:44,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:41:44,624 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:44,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 122 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:41:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 13:41:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 13:41:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:41:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2024-11-13 13:41:44,654 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 192 [2024-11-13 13:41:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:44,656 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2024-11-13 13:41:44,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-11-13 13:41:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-13 13:41:44,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:44,662 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:44,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:41:44,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1406316, now seen corresponding path program 1 times [2024-11-13 13:41:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652751883] [2024-11-13 13:41:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652751883] [2024-11-13 13:41:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652751883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:41:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313418995] [2024-11-13 13:41:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:45,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:41:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:45,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:41:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:41:45,022 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:45,095 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2024-11-13 13:41:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:41:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-13 13:41:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:45,097 INFO L225 Difference]: With dead ends: 180 [2024-11-13 13:41:45,097 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:41:45,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:41:45,098 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:45,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:41:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:41:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:41:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:41:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-13 13:41:45,115 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 193 [2024-11-13 13:41:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:45,116 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-13 13:41:45,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-13 13:41:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-13 13:41:45,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:45,119 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:45,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:41:45,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 256759122, now seen corresponding path program 1 times [2024-11-13 13:41:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335841951] [2024-11-13 13:41:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335841951] [2024-11-13 13:41:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335841951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:41:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130777866] [2024-11-13 13:41:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:45,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:41:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:41:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:41:45,957 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:46,743 INFO L93 Difference]: Finished difference Result 294 states and 434 transitions. [2024-11-13 13:41:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:41:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-13 13:41:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:46,747 INFO L225 Difference]: With dead ends: 294 [2024-11-13 13:41:46,747 INFO L226 Difference]: Without dead ends: 205 [2024-11-13 13:41:46,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:41:46,751 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 163 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:46,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 409 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:41:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-13 13:41:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2024-11-13 13:41:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:41:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 269 transitions. [2024-11-13 13:41:46,837 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 269 transitions. Word has length 193 [2024-11-13 13:41:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:46,839 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 269 transitions. [2024-11-13 13:41:46,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 269 transitions. [2024-11-13 13:41:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-13 13:41:46,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:46,843 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:46,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:41:46,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:46,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -974265913, now seen corresponding path program 1 times [2024-11-13 13:41:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983895255] [2024-11-13 13:41:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:41:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983895255] [2024-11-13 13:41:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983895255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:41:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041127695] [2024-11-13 13:41:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:41:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:41:47,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:41:47,335 INFO L87 Difference]: Start difference. First operand 182 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:47,607 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2024-11-13 13:41:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:41:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-13 13:41:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:47,610 INFO L225 Difference]: With dead ends: 361 [2024-11-13 13:41:47,610 INFO L226 Difference]: Without dead ends: 182 [2024-11-13 13:41:47,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:41:47,612 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 193 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:47,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 239 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:41:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-13 13:41:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2024-11-13 13:41:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.25) internal successors, (150), 120 states have internal predecessors, (150), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:41:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2024-11-13 13:41:47,670 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 194 [2024-11-13 13:41:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:47,671 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2024-11-13 13:41:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:41:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2024-11-13 13:41:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-13 13:41:47,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:47,674 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:47,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:41:47,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -716100475, now seen corresponding path program 1 times [2024-11-13 13:41:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:47,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911246628] [2024-11-13 13:41:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:41:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:41:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:41:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:41:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:41:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:41:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:41:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:41:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:41:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:41:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:41:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:41:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:41:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:41:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:41:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:41:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:41:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:41:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:41:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 13:41:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 13:41:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 13:41:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 13:41:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 13:41:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 13:41:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 13:41:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-13 13:41:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 13:41:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 13:41:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-13 13:41:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911246628] [2024-11-13 13:41:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911246628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419224673] [2024-11-13 13:41:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:48,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:48,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:48,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:41:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:48,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:41:48,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-13 13:41:48,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-13 13:41:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419224673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:49,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-13 13:41:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932731400] [2024-11-13 13:41:49,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:41:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:41:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:41:49,141 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-13 13:41:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:49,574 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2024-11-13 13:41:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:41:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 194 [2024-11-13 13:41:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:41:49,577 INFO L225 Difference]: With dead ends: 371 [2024-11-13 13:41:49,578 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 13:41:49,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:41:49,581 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 122 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:41:49,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 234 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:41:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 13:41:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2024-11-13 13:41:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 126 states have internal predecessors, (154), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:41:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2024-11-13 13:41:49,685 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 194 [2024-11-13 13:41:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:41:49,686 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2024-11-13 13:41:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-13 13:41:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2024-11-13 13:41:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-13 13:41:49,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:41:49,691 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:49,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:41:49,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:49,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:41:49,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 111849947, now seen corresponding path program 1 times [2024-11-13 13:41:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200849376] [2024-11-13 13:41:49,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:49,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:50,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:50,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:50,343 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:41:50,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:41:50,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:41:50,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:50,564 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:41:50,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:41:50 BoogieIcfgContainer [2024-11-13 13:41:50,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:41:50,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:41:50,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:41:50,573 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:41:50,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:41:40" (3/4) ... [2024-11-13 13:41:50,576 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:41:50,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:41:50,579 INFO L158 Benchmark]: Toolchain (without parser) took 11850.87ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.3MB in the beginning and 71.0MB in the end (delta: 21.4MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2024-11-13 13:41:50,579 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:41:50,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.97ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:41:50,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.30ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 72.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:41:50,580 INFO L158 Benchmark]: Boogie Preprocessor took 99.11ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 64.9MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:41:50,580 INFO L158 Benchmark]: RCFGBuilder took 945.92ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 38.6MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:41:50,581 INFO L158 Benchmark]: TraceAbstraction took 10175.54ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 38.1MB in the beginning and 71.0MB in the end (delta: -32.9MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-13 13:41:50,581 INFO L158 Benchmark]: Witness Printer took 6.29ms. Allocated memory is still 176.2MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:41:50,584 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.42ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.97ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.30ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 72.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 99.11ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 64.9MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 945.92ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 38.6MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10175.54ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 38.1MB in the beginning and 71.0MB in the end (delta: -32.9MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 6.29ms. Allocated memory is still 176.2MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseAnd at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] double var_1_28 = 9.25; [L44] double var_1_29 = 0.0; [L45] double var_1_30 = 127.6; [L46] unsigned long int var_1_32 = 128; [L47] unsigned long int var_1_34 = 1089279310; [L48] unsigned long int var_1_35 = 1307137784; [L49] unsigned long int var_1_36 = 1417807175; [L50] unsigned long int var_1_38 = 2; [L51] unsigned short int var_1_40 = 5; [L52] unsigned char var_1_44 = 5; [L53] unsigned char var_1_46 = 16; [L54] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L177] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L128] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] var_1_3 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L131] var_1_4 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L133] var_1_5 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L141] var_1_13 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L145] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L147] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L153] var_1_21 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L157] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L159] var_1_29 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L160] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L161] var_1_30 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L163] var_1_34 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L166] var_1_35 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L167] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L169] var_1_36 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L172] var_1_46 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L174] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L174] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L188] RET updateVariables() [L189] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L59] COND TRUE stepLocal_0 >= last_1_var_1_10 [L60] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L64] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L67] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L68] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] COND TRUE -32 < (var_1_10 & var_1_12) [L72] var_1_44 = ((((var_1_12) < ((var_1_46 + 10))) ? (var_1_12) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L76] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L79] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L80] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L83] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_16) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L84] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L85] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] EXPR var_1_9 & var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] COND FALSE !((var_1_9 & var_1_18) >= -2) [L92] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L95] COND FALSE !((((((var_1_30 * var_1_17)) < (var_1_29)) ? ((var_1_30 * var_1_17)) : (var_1_29))) >= (- var_1_16)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L102] COND FALSE !(\read(var_1_19)) [L105] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] COND FALSE !((var_1_35 | var_1_10) > var_1_18) [L118] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L119] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L120] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 2421 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1210 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 1211 mSDtfsCounter, 435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=9, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 198 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2115 NumberOfCodeBlocks, 2115 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2103 ConstructedInterpolants, 0 QuantifiedInterpolants, 5451 SizeOfPredicates, 3 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 17819/17864 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 [2024-11-13 13:41:50,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd --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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:41:53,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:41:53,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:41:53,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:41:53,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:41:53,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:41:53,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:41:53,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:41:53,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:41:53,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:41:53,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:41:53,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:41:53,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:41:53,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:41:53,935 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:41:53,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:41:53,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:41:53,936 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:41:53,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:41:53,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:41:53,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:41:53,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:41:53,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:41:53,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:41:53,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:41:53,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:41:53,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:41:53,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:41:53,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:41:53,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:41:53,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:41:53,940 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2024-11-13 13:41:54,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:41:54,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:41:54,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:41:54,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:41:54,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:41:54,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i Unable to find full path for "g++" [2024-11-13 13:41:56,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:41:56,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:41:56,833 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-13 13:41:56,843 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/342bc326e/2c222dfe028f40d59af6ad446becb7b2/FLAGd8358192e [2024-11-13 13:41:56,862 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/data/342bc326e/2c222dfe028f40d59af6ad446becb7b2 [2024-11-13 13:41:56,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:41:56,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:41:56,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:56,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:41:56,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:41:56,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:56" (1/1) ... [2024-11-13 13:41:56,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760b104e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:56, skipping insertion in model container [2024-11-13 13:41:56,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:56" (1/1) ... [2024-11-13 13:41:56,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:41:57,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2024-11-13 13:41:57,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:57,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:41:57,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2024-11-13 13:41:57,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:57,368 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:41:57,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57 WrapperNode [2024-11-13 13:41:57,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:57,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:57,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:41:57,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:41:57,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,452 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-13 13:41:57,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:57,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:41:57,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:41:57,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:41:57,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,489 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]. [2024-11-13 13:41:57,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:41:57,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:41:57,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:41:57,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:41:57,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (1/1) ... [2024-11-13 13:41:57,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:41:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:57,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:57,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:41:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:41:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:41:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:41:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:41:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:41:57,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:41:57,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:41:57,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:42:31,673 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 13:42:31,674 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:42:31,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:42:31,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:42:31,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:42:31 BoogieIcfgContainer [2024-11-13 13:42:31,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:42:31,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:42:31,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:42:31,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:42:31,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:41:56" (1/3) ... [2024-11-13 13:42:31,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aea4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:42:31, skipping insertion in model container [2024-11-13 13:42:31,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:57" (2/3) ... [2024-11-13 13:42:31,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aea4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:42:31, skipping insertion in model container [2024-11-13 13:42:31,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:42:31" (3/3) ... [2024-11-13 13:42:31,700 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-13 13:42:31,717 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:42:31,720 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:42:31,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:42:31,813 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@783cdbec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:42:31,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:42:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 13:42:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 13:42:31,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:42:31,836 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:42:31,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:42:31,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash -709556610, now seen corresponding path program 1 times [2024-11-13 13:42:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:42:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162337678] [2024-11-13 13:42:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:42:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:42:31,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:42:31,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:42:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:33,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:42:33,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:42:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:42:37,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:42:37,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:42:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162337678] [2024-11-13 13:42:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162337678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:42:37,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:42:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:42:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778052096] [2024-11-13 13:42:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:42:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:42:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:42:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:42:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:42:37,730 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:42:42,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:42:46,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:42:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:42:46,605 INFO L93 Difference]: Finished difference Result 242 states and 444 transitions. [2024-11-13 13:42:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:42:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-13 13:42:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:42:46,619 INFO L225 Difference]: With dead ends: 242 [2024-11-13 13:42:46,620 INFO L226 Difference]: Without dead ends: 159 [2024-11-13 13:42:46,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:42:46,627 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:42:46,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-13 13:42:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-13 13:42:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-13 13:42:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:42:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2024-11-13 13:42:46,740 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 187 [2024-11-13 13:42:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:42:46,742 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2024-11-13 13:42:46,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:42:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2024-11-13 13:42:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 13:42:46,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:42:46,751 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:42:46,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:42:46,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:42:46,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:42:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1018040834, now seen corresponding path program 1 times [2024-11-13 13:42:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:42:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689864890] [2024-11-13 13:42:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:42:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:42:46,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:42:46,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:42:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:48,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:42:48,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:42:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:42:49,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:42:49,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:42:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689864890] [2024-11-13 13:42:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689864890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:42:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:42:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:42:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048024752] [2024-11-13 13:42:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:42:49,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:42:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:42:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:42:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:42:49,196 INFO L87 Difference]: Start difference. First operand 157 states and 239 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:42:54,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:42:58,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:43:02,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:43:06,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:43:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:43:06,539 INFO L93 Difference]: Finished difference Result 465 states and 711 transitions. [2024-11-13 13:43:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:43:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-13 13:43:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:43:06,548 INFO L225 Difference]: With dead ends: 465 [2024-11-13 13:43:06,548 INFO L226 Difference]: Without dead ends: 311 [2024-11-13 13:43:06,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:43:06,550 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 121 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:43:06,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2024-11-13 13:43:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-13 13:43:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 163. [2024-11-13 13:43:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 102 states have internal predecessors, (130), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 13:43:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2024-11-13 13:43:06,627 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 187 [2024-11-13 13:43:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:43:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2024-11-13 13:43:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:43:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2024-11-13 13:43:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 13:43:06,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:43:06,636 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:43:06,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 13:43:06,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:43:06,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:43:06,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1282781756, now seen corresponding path program 1 times [2024-11-13 13:43:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:43:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609927022] [2024-11-13 13:43:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:06,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:43:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:43:06,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:43:06,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:43:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:08,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:43:08,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:43:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:43:12,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:43:12,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:43:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609927022] [2024-11-13 13:43:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609927022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:43:12,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:43:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:43:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678432322] [2024-11-13 13:43:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:43:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:43:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:43:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:43:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:43:12,475 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:43:17,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:22,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:26,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:30,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:33,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:37,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:42,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:46,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:50,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:54,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:43:58,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:02,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:06,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:11,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:15,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:19,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:23,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:44:23,502 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2024-11-13 13:44:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:44:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-13 13:44:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:44:23,507 INFO L225 Difference]: With dead ends: 421 [2024-11-13 13:44:23,507 INFO L226 Difference]: Without dead ends: 261 [2024-11-13 13:44:23,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:44:23,509 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 93 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 59 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:44:23,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 439 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 102 Invalid, 15 Unknown, 0 Unchecked, 70.8s Time] [2024-11-13 13:44:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-13 13:44:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2024-11-13 13:44:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 149 states have (on average 1.25503355704698) internal successors, (187), 149 states have internal predecessors, (187), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-13 13:44:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 361 transitions. [2024-11-13 13:44:23,565 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 361 transitions. Word has length 187 [2024-11-13 13:44:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:44:23,565 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 361 transitions. [2024-11-13 13:44:23,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:44:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 361 transitions. [2024-11-13 13:44:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 13:44:23,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:44:23,569 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:44:23,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 13:44:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:44:23,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:44:23,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1448837877, now seen corresponding path program 1 times [2024-11-13 13:44:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:44:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016361407] [2024-11-13 13:44:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:44:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:44:23,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:44:23,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:44:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:25,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:44:25,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:44:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-13 13:44:29,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:44:29,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:44:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016361407] [2024-11-13 13:44:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016361407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:44:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:44:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:44:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882422267] [2024-11-13 13:44:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:44:29,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:44:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:44:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:44:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:44:29,280 INFO L87 Difference]: Start difference. First operand 240 states and 361 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:44:30,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:44:35,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:44:40,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:44,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:44:50,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:44:54,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:44:55,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:44:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:44:57,834 INFO L93 Difference]: Finished difference Result 785 states and 1189 transitions. [2024-11-13 13:44:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:44:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-11-13 13:44:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:44:57,842 INFO L225 Difference]: With dead ends: 785 [2024-11-13 13:44:57,842 INFO L226 Difference]: Without dead ends: 548 [2024-11-13 13:44:57,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:44:57,847 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 177 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:44:57,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 289 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 5 Unknown, 0 Unchecked, 28.5s Time] [2024-11-13 13:44:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-13 13:44:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 409. [2024-11-13 13:44:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 258 states have (on average 1.2674418604651163) internal successors, (327), 258 states have internal predecessors, (327), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-13 13:44:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 617 transitions. [2024-11-13 13:44:57,944 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 617 transitions. Word has length 189 [2024-11-13 13:44:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:44:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 617 transitions. [2024-11-13 13:44:57,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-13 13:44:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 617 transitions. [2024-11-13 13:44:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 13:44:57,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:44:57,951 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:44:57,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:44:58,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:44:58,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:44:58,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2145064841, now seen corresponding path program 1 times [2024-11-13 13:44:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:44:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712912793] [2024-11-13 13:44:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:44:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:44:58,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:44:58,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c827450-dbe9-4af0-af2e-667a9c0df25e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 13:44:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:59,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:44:59,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:45:07,089 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:20,773 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:33,782 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:45:37,816 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from false [2024-11-13 13:45:41,848 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from true [2024-11-13 13:45:53,139 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:01,246 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:09,357 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:17,423 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:26,699 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:32,600 WARN L286 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:41,890 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:50,051 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:58,164 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:04,259 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:33,448 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:39,685 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:47,807 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:47:55,784 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:03,853 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:07,891 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from false [2024-11-13 13:48:11,923 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from true [2024-11-13 13:48:19,474 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:31,123 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:36,356 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:44,462 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:55,230 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:06,711 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:13,423 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:20,857 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:28,979 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:36,190 WARN L286 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:44,300 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:01,738 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:08,228 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:12,265 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from false [2024-11-13 13:50:16,297 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from true [2024-11-13 13:50:24,436 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:35,065 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:44,496 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:50:55,503 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:51:03,637 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:51:11,742 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:51:17,824 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:51:25,217 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:51:30,426 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= c_~var_1_18~0 c_~var_1_14~0) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from true