./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:11:28,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:11:28,463 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:11:28,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:11:28,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:11:28,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:11:28,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:11:28,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:11:28,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:11:28,494 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:11:28,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:11:28,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:11:28,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:11:28,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:11:28,497 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:11:28,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:11:28,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:11:28,498 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:11:28,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:11:28,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:11:28,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:11:28,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:11:28,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:11:28,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:11:28,502 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:11:28,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:11:28,502 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:11:28,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:11:28,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:11:28,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:11:28,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:11:28,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:11:28,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:11:28,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:11:28,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:11:28,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:11:28,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:11:28,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:11:28,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:11:28,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:11:28,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:11:28,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:11:28,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2023-11-29 03:11:28,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:11:28,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:11:28,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:11:28,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:11:28,773 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:11:28,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:11:31,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:11:31,688 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:11:31,688 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:11:31,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/e6e46a698/594d089573f94c21b6bab9547dfd7ad8/FLAGe3975ce6e [2023-11-29 03:11:31,713 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/e6e46a698/594d089573f94c21b6bab9547dfd7ad8 [2023-11-29 03:11:31,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:11:31,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:11:31,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:11:31,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:11:31,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:11:31,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:11:31" (1/1) ... [2023-11-29 03:11:31,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21048a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:31, skipping insertion in model container [2023-11-29 03:11:31,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:11:31" (1/1) ... [2023-11-29 03:11:31,755 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:11:31,903 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2023-11-29 03:11:31,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:11:31,970 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:11:31,982 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2023-11-29 03:11:32,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:11:32,039 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:11:32,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32 WrapperNode [2023-11-29 03:11:32,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:11:32,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:11:32,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:11:32,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:11:32,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,103 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 391 [2023-11-29 03:11:32,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:11:32,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:11:32,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:11:32,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:11:32,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,134 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-11-29 03:11:32,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:11:32,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:11:32,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:11:32,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:11:32,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (1/1) ... [2023-11-29 03:11:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:11:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:11:32,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:11:32,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:11:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:11:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 03:11:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 03:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 03:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:11:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:11:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:11:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:11:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:11:32,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:11:32,366 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:11:32,369 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:11:32,781 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:11:32,815 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:11:32,815 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:11:32,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:11:32 BoogieIcfgContainer [2023-11-29 03:11:32,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:11:32,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:11:32,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:11:32,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:11:32,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:11:31" (1/3) ... [2023-11-29 03:11:32,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d248ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:11:32, skipping insertion in model container [2023-11-29 03:11:32,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:32" (2/3) ... [2023-11-29 03:11:32,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d248ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:11:32, skipping insertion in model container [2023-11-29 03:11:32,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:11:32" (3/3) ... [2023-11-29 03:11:32,838 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:11:32,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:11:32,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:11:32,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:11:32,920 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@742b66d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:11:32,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:11:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:11:32,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:32,941 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:32,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:32,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-11-29 03:11:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652852068] [2023-11-29 03:11:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652852068] [2023-11-29 03:11:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652852068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:11:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980879615] [2023-11-29 03:11:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:33,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:11:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:33,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:11:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:11:33,385 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:33,432 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 03:11:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:11:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 03:11:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:33,444 INFO L225 Difference]: With dead ends: 223 [2023-11-29 03:11:33,445 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:11:33,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:11:33,453 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:33,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:11:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 03:11:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 03:11:33,509 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 03:11:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:33,509 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 03:11:33,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 03:11:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:11:33,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:33,515 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:33,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:11:33,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:33,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-11-29 03:11:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114384931] [2023-11-29 03:11:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114384931] [2023-11-29 03:11:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114384931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:33,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:11:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060556724] [2023-11-29 03:11:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:33,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:11:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:11:33,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:33,800 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:33,838 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2023-11-29 03:11:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:11:33,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 03:11:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:33,841 INFO L225 Difference]: With dead ends: 222 [2023-11-29 03:11:33,842 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 03:11:33,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:33,844 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:33,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 03:11:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 03:11:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2023-11-29 03:11:33,859 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2023-11-29 03:11:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:33,861 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2023-11-29 03:11:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2023-11-29 03:11:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:11:33,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:33,865 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:11:33,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:33,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2023-11-29 03:11:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118604030] [2023-11-29 03:11:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:34,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118604030] [2023-11-29 03:11:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118604030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:34,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:34,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:11:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742253048] [2023-11-29 03:11:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:34,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:11:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:11:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:11:34,205 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:34,261 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2023-11-29 03:11:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:11:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 03:11:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:34,264 INFO L225 Difference]: With dead ends: 247 [2023-11-29 03:11:34,264 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 03:11:34,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:34,267 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:34,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 487 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 03:11:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2023-11-29 03:11:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-11-29 03:11:34,280 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2023-11-29 03:11:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:34,281 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-11-29 03:11:34,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-11-29 03:11:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 03:11:34,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:34,284 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:34,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:11:34,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:34,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2023-11-29 03:11:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223054003] [2023-11-29 03:11:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223054003] [2023-11-29 03:11:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223054003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:11:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053123545] [2023-11-29 03:11:34,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:34,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:11:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:34,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:11:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:34,468 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:34,501 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2023-11-29 03:11:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:11:34,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 03:11:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:34,504 INFO L225 Difference]: With dead ends: 276 [2023-11-29 03:11:34,504 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 03:11:34,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:34,506 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:34,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 03:11:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2023-11-29 03:11:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2023-11-29 03:11:34,520 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2023-11-29 03:11:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:34,521 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2023-11-29 03:11:34,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2023-11-29 03:11:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 03:11:34,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:34,534 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:34,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:11:34,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:34,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2023-11-29 03:11:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272080] [2023-11-29 03:11:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272080] [2023-11-29 03:11:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:11:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949300203] [2023-11-29 03:11:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:34,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:11:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:11:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:34,699 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:34,727 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2023-11-29 03:11:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:11:34,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 03:11:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:34,729 INFO L225 Difference]: With dead ends: 280 [2023-11-29 03:11:34,730 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 03:11:34,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:34,731 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:34,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 03:11:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2023-11-29 03:11:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2023-11-29 03:11:34,743 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2023-11-29 03:11:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:34,744 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2023-11-29 03:11:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2023-11-29 03:11:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 03:11:34,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:34,747 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:34,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:11:34,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:34,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2023-11-29 03:11:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665267069] [2023-11-29 03:11:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665267069] [2023-11-29 03:11:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665267069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:11:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585703753] [2023-11-29 03:11:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:11:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:11:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:35,382 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:35,690 INFO L93 Difference]: Finished difference Result 263 states and 383 transitions. [2023-11-29 03:11:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:11:35,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-11-29 03:11:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:35,694 INFO L225 Difference]: With dead ends: 263 [2023-11-29 03:11:35,694 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 03:11:35,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:35,695 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 184 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:35,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 186 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:11:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 03:11:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2023-11-29 03:11:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2023-11-29 03:11:35,709 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 171 [2023-11-29 03:11:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:35,710 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2023-11-29 03:11:35,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2023-11-29 03:11:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 03:11:35,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:35,712 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:11:35,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:35,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2023-11-29 03:11:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030026218] [2023-11-29 03:11:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030026218] [2023-11-29 03:11:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030026218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165236174] [2023-11-29 03:11:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:36,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:36,614 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:37,006 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2023-11-29 03:11:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:11:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2023-11-29 03:11:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:37,009 INFO L225 Difference]: With dead ends: 266 [2023-11-29 03:11:37,009 INFO L226 Difference]: Without dead ends: 139 [2023-11-29 03:11:37,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:11:37,010 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 191 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:37,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 239 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:11:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-29 03:11:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2023-11-29 03:11:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2023-11-29 03:11:37,023 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 173 [2023-11-29 03:11:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:37,024 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2023-11-29 03:11:37,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2023-11-29 03:11:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 03:11:37,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:37,026 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:37,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:11:37,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:37,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash 556345530, now seen corresponding path program 1 times [2023-11-29 03:11:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262480924] [2023-11-29 03:11:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262480924] [2023-11-29 03:11:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262480924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:11:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337392650] [2023-11-29 03:11:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:37,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:11:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:11:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:37,206 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:37,241 INFO L93 Difference]: Finished difference Result 274 states and 393 transitions. [2023-11-29 03:11:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:11:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 03:11:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:37,243 INFO L225 Difference]: With dead ends: 274 [2023-11-29 03:11:37,243 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:11:37,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:11:37,244 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:37,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:11:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2023-11-29 03:11:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2023-11-29 03:11:37,256 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 173 [2023-11-29 03:11:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:37,257 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2023-11-29 03:11:37,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2023-11-29 03:11:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:37,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:37,259 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:11:37,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:37,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-11-29 03:11:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833509223] [2023-11-29 03:11:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833509223] [2023-11-29 03:11:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833509223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:11:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524041681] [2023-11-29 03:11:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:38,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:11:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:11:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:11:38,354 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:38,907 INFO L93 Difference]: Finished difference Result 405 states and 573 transitions. [2023-11-29 03:11:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:11:38,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:38,911 INFO L225 Difference]: With dead ends: 405 [2023-11-29 03:11:38,911 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 03:11:38,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:11:38,912 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 328 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:38,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1215 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:11:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 03:11:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 158. [2023-11-29 03:11:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 133 states have internal predecessors, (175), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 221 transitions. [2023-11-29 03:11:38,931 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 221 transitions. Word has length 175 [2023-11-29 03:11:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:38,932 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 221 transitions. [2023-11-29 03:11:38,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 221 transitions. [2023-11-29 03:11:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:38,934 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:38,935 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:38,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:11:38,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:38,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2023-11-29 03:11:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395232940] [2023-11-29 03:11:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:39,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395232940] [2023-11-29 03:11:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395232940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:11:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716945117] [2023-11-29 03:11:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:39,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:11:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:11:39,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:11:39,173 INFO L87 Difference]: Start difference. First operand 158 states and 221 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:39,219 INFO L93 Difference]: Finished difference Result 353 states and 493 transitions. [2023-11-29 03:11:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:11:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:39,222 INFO L225 Difference]: With dead ends: 353 [2023-11-29 03:11:39,222 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 03:11:39,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:39,224 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 63 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:39,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 447 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 03:11:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 162. [2023-11-29 03:11:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 137 states have internal predecessors, (179), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 225 transitions. [2023-11-29 03:11:39,243 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 225 transitions. Word has length 175 [2023-11-29 03:11:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:39,243 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 225 transitions. [2023-11-29 03:11:39,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 225 transitions. [2023-11-29 03:11:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:39,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:39,246 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:39,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:11:39,246 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:39,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-11-29 03:11:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40439932] [2023-11-29 03:11:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:39,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40439932] [2023-11-29 03:11:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40439932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111934030] [2023-11-29 03:11:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:39,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:39,716 INFO L87 Difference]: Start difference. First operand 162 states and 225 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:39,912 INFO L93 Difference]: Finished difference Result 401 states and 550 transitions. [2023-11-29 03:11:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:11:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:39,915 INFO L225 Difference]: With dead ends: 401 [2023-11-29 03:11:39,915 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 03:11:39,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:11:39,916 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 175 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:39,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 525 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:11:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 03:11:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 199. [2023-11-29 03:11:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 172 states have internal predecessors, (222), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:11:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 272 transitions. [2023-11-29 03:11:39,937 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 272 transitions. Word has length 175 [2023-11-29 03:11:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:39,937 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 272 transitions. [2023-11-29 03:11:39,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 272 transitions. [2023-11-29 03:11:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:39,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:39,940 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:39,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:11:39,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:39,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1242159848, now seen corresponding path program 1 times [2023-11-29 03:11:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764938755] [2023-11-29 03:11:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:41,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764938755] [2023-11-29 03:11:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764938755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908952452] [2023-11-29 03:11:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:41,707 INFO L87 Difference]: Start difference. First operand 199 states and 272 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:41,943 INFO L93 Difference]: Finished difference Result 568 states and 769 transitions. [2023-11-29 03:11:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:11:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 03:11:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:41,948 INFO L225 Difference]: With dead ends: 568 [2023-11-29 03:11:41,948 INFO L226 Difference]: Without dead ends: 370 [2023-11-29 03:11:41,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:41,949 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:41,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 434 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-29 03:11:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 261. [2023-11-29 03:11:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 233 states have (on average 1.3047210300429184) internal successors, (304), 234 states have internal predecessors, (304), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:11:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 354 transitions. [2023-11-29 03:11:41,970 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 354 transitions. Word has length 175 [2023-11-29 03:11:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:41,971 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 354 transitions. [2023-11-29 03:11:41,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 354 transitions. [2023-11-29 03:11:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:41,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:41,974 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:41,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:11:41,974 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:41,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2023-11-29 03:11:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:41,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430694259] [2023-11-29 03:11:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430694259] [2023-11-29 03:11:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430694259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:11:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495732579] [2023-11-29 03:11:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:42,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:11:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:11:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:11:42,142 INFO L87 Difference]: Start difference. First operand 261 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:42,183 INFO L93 Difference]: Finished difference Result 492 states and 669 transitions. [2023-11-29 03:11:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:11:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:42,186 INFO L225 Difference]: With dead ends: 492 [2023-11-29 03:11:42,186 INFO L226 Difference]: Without dead ends: 232 [2023-11-29 03:11:42,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:42,188 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:42,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-29 03:11:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2023-11-29 03:11:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 205 states have internal predecessors, (264), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:11:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 314 transitions. [2023-11-29 03:11:42,207 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 314 transitions. Word has length 175 [2023-11-29 03:11:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:42,208 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 314 transitions. [2023-11-29 03:11:42,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 314 transitions. [2023-11-29 03:11:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:42,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:42,211 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:42,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:11:42,211 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:42,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1304199462, now seen corresponding path program 1 times [2023-11-29 03:11:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429379852] [2023-11-29 03:11:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429379852] [2023-11-29 03:11:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429379852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410558770] [2023-11-29 03:11:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:43,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:43,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:43,654 INFO L87 Difference]: Start difference. First operand 232 states and 314 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:43,954 INFO L93 Difference]: Finished difference Result 628 states and 846 transitions. [2023-11-29 03:11:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:11:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 03:11:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:43,958 INFO L225 Difference]: With dead ends: 628 [2023-11-29 03:11:43,958 INFO L226 Difference]: Without dead ends: 397 [2023-11-29 03:11:43,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:43,960 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:43,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 485 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:11:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-29 03:11:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 319. [2023-11-29 03:11:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 291 states have (on average 1.302405498281787) internal successors, (379), 292 states have internal predecessors, (379), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:11:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 429 transitions. [2023-11-29 03:11:43,985 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 429 transitions. Word has length 175 [2023-11-29 03:11:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:43,986 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 429 transitions. [2023-11-29 03:11:43,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2023-11-29 03:11:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:43,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:43,990 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:43,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:11:43,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:43,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-11-29 03:11:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:43,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065804716] [2023-11-29 03:11:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065804716] [2023-11-29 03:11:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065804716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:44,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065783081] [2023-11-29 03:11:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:44,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:44,382 INFO L87 Difference]: Start difference. First operand 319 states and 429 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:44,632 INFO L93 Difference]: Finished difference Result 648 states and 868 transitions. [2023-11-29 03:11:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:11:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:44,635 INFO L225 Difference]: With dead ends: 648 [2023-11-29 03:11:44,635 INFO L226 Difference]: Without dead ends: 330 [2023-11-29 03:11:44,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:11:44,636 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 66 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 563 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-11-29 03:11:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 294. [2023-11-29 03:11:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 266 states have (on average 1.2932330827067668) internal successors, (344), 267 states have internal predecessors, (344), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:11:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2023-11-29 03:11:44,655 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2023-11-29 03:11:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:44,656 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2023-11-29 03:11:44,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2023-11-29 03:11:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:44,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:44,659 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:44,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:11:44,659 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:44,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-11-29 03:11:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:44,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806686441] [2023-11-29 03:11:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:45,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806686441] [2023-11-29 03:11:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806686441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390459538] [2023-11-29 03:11:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:45,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:45,010 INFO L87 Difference]: Start difference. First operand 294 states and 394 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:45,258 INFO L93 Difference]: Finished difference Result 596 states and 791 transitions. [2023-11-29 03:11:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:11:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:45,261 INFO L225 Difference]: With dead ends: 596 [2023-11-29 03:11:45,261 INFO L226 Difference]: Without dead ends: 303 [2023-11-29 03:11:45,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:11:45,263 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 66 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:45,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 675 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-29 03:11:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 234. [2023-11-29 03:11:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.2788461538461537) internal successors, (266), 208 states have internal predecessors, (266), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 312 transitions. [2023-11-29 03:11:45,279 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 312 transitions. Word has length 175 [2023-11-29 03:11:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:45,280 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 312 transitions. [2023-11-29 03:11:45,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 312 transitions. [2023-11-29 03:11:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:45,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:45,282 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:45,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:11:45,282 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:45,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1806691688, now seen corresponding path program 1 times [2023-11-29 03:11:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705596000] [2023-11-29 03:11:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:46,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:46,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705596000] [2023-11-29 03:11:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705596000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602275777] [2023-11-29 03:11:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:46,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:46,652 INFO L87 Difference]: Start difference. First operand 234 states and 312 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:46,868 INFO L93 Difference]: Finished difference Result 491 states and 653 transitions. [2023-11-29 03:11:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:11:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 03:11:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:46,870 INFO L225 Difference]: With dead ends: 491 [2023-11-29 03:11:46,870 INFO L226 Difference]: Without dead ends: 258 [2023-11-29 03:11:46,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:46,872 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:46,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 506 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-29 03:11:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2023-11-29 03:11:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.2644230769230769) internal successors, (263), 208 states have internal predecessors, (263), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 309 transitions. [2023-11-29 03:11:46,885 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 309 transitions. Word has length 175 [2023-11-29 03:11:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:46,886 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 309 transitions. [2023-11-29 03:11:46,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 309 transitions. [2023-11-29 03:11:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:46,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:46,888 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:11:46,888 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:46,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2064857126, now seen corresponding path program 1 times [2023-11-29 03:11:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695409750] [2023-11-29 03:11:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695409750] [2023-11-29 03:11:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695409750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298605659] [2023-11-29 03:11:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:48,166 INFO L87 Difference]: Start difference. First operand 234 states and 309 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:48,454 INFO L93 Difference]: Finished difference Result 497 states and 654 transitions. [2023-11-29 03:11:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:11:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 03:11:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:48,457 INFO L225 Difference]: With dead ends: 497 [2023-11-29 03:11:48,457 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 03:11:48,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:48,459 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 53 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:48,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 618 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 03:11:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2023-11-29 03:11:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 204 states have (on average 1.2598039215686274) internal successors, (257), 204 states have internal predecessors, (257), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 303 transitions. [2023-11-29 03:11:48,478 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 303 transitions. Word has length 175 [2023-11-29 03:11:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:48,478 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 303 transitions. [2023-11-29 03:11:48,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2023-11-29 03:11:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:48,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:48,480 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 03:11:48,481 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:48,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2023-11-29 03:11:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682021267] [2023-11-29 03:11:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:48,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682021267] [2023-11-29 03:11:48,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682021267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:48,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249678735] [2023-11-29 03:11:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:48,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:48,776 INFO L87 Difference]: Start difference. First operand 230 states and 303 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:49,012 INFO L93 Difference]: Finished difference Result 515 states and 678 transitions. [2023-11-29 03:11:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:11:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:49,015 INFO L225 Difference]: With dead ends: 515 [2023-11-29 03:11:49,015 INFO L226 Difference]: Without dead ends: 286 [2023-11-29 03:11:49,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:11:49,017 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 92 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:49,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 646 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-29 03:11:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 230. [2023-11-29 03:11:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 204 states have internal predecessors, (256), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:11:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2023-11-29 03:11:49,032 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 175 [2023-11-29 03:11:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:49,032 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2023-11-29 03:11:49,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2023-11-29 03:11:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:49,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:49,034 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:49,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:11:49,034 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:49,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2023-11-29 03:11:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282810883] [2023-11-29 03:11:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:50,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282810883] [2023-11-29 03:11:50,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282810883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:50,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:50,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:11:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826940872] [2023-11-29 03:11:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:50,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:11:50,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:50,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:11:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:11:50,780 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:51,551 INFO L93 Difference]: Finished difference Result 513 states and 675 transitions. [2023-11-29 03:11:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:11:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 03:11:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:51,554 INFO L225 Difference]: With dead ends: 513 [2023-11-29 03:11:51,554 INFO L226 Difference]: Without dead ends: 284 [2023-11-29 03:11:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:11:51,555 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 163 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:51,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1345 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:11:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-29 03:11:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2023-11-29 03:11:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 237 states have (on average 1.261603375527426) internal successors, (299), 238 states have internal predecessors, (299), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 03:11:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 355 transitions. [2023-11-29 03:11:51,573 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 355 transitions. Word has length 175 [2023-11-29 03:11:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:51,573 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 355 transitions. [2023-11-29 03:11:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:11:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 355 transitions. [2023-11-29 03:11:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:11:51,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:51,574 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:11:51,575 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:51,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 715202965, now seen corresponding path program 1 times [2023-11-29 03:11:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560842024] [2023-11-29 03:11:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560842024] [2023-11-29 03:11:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560842024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:11:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583495054] [2023-11-29 03:11:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:51,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:11:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:11:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:11:51,760 INFO L87 Difference]: Start difference. First operand 270 states and 355 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:52,010 INFO L93 Difference]: Finished difference Result 708 states and 930 transitions. [2023-11-29 03:11:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:11:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:11:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:52,014 INFO L225 Difference]: With dead ends: 708 [2023-11-29 03:11:52,014 INFO L226 Difference]: Without dead ends: 439 [2023-11-29 03:11:52,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:52,015 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:52,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 346 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-29 03:11:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 331. [2023-11-29 03:11:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 273 states have (on average 1.2380952380952381) internal successors, (338), 274 states have internal predecessors, (338), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 03:11:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2023-11-29 03:11:52,046 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 175 [2023-11-29 03:11:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:52,046 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2023-11-29 03:11:52,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2023-11-29 03:11:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 03:11:52,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:52,048 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:52,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 03:11:52,048 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:52,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1506119645, now seen corresponding path program 1 times [2023-11-29 03:11:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423014237] [2023-11-29 03:11:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423014237] [2023-11-29 03:11:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423014237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:11:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905000201] [2023-11-29 03:11:52,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:52,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:11:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:11:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:11:52,233 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:52,289 INFO L93 Difference]: Finished difference Result 612 states and 810 transitions. [2023-11-29 03:11:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:11:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-11-29 03:11:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:52,292 INFO L225 Difference]: With dead ends: 612 [2023-11-29 03:11:52,292 INFO L226 Difference]: Without dead ends: 343 [2023-11-29 03:11:52,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:11:52,294 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 24 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:52,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:11:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-29 03:11:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2023-11-29 03:11:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 279 states have (on average 1.2329749103942653) internal successors, (344), 280 states have internal predecessors, (344), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 03:11:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 446 transitions. [2023-11-29 03:11:52,315 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 446 transitions. Word has length 177 [2023-11-29 03:11:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:52,315 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 446 transitions. [2023-11-29 03:11:52,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2023-11-29 03:11:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:11:52,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:52,316 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:52,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:11:52,316 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:52,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -305973112, now seen corresponding path program 1 times [2023-11-29 03:11:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425976514] [2023-11-29 03:11:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:11:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:11:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:11:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:11:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:11:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:11:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:11:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:11:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:11:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:11:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:11:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:11:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:11:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:11:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:11:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:11:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:11:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:11:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:11:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425976514] [2023-11-29 03:11:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425976514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:11:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:11:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:11:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983689431] [2023-11-29 03:11:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:11:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:11:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:52,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:11:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:11:52,650 INFO L87 Difference]: Start difference. First operand 337 states and 446 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:52,939 INFO L93 Difference]: Finished difference Result 608 states and 797 transitions. [2023-11-29 03:11:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:11:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2023-11-29 03:11:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:52,943 INFO L225 Difference]: With dead ends: 608 [2023-11-29 03:11:52,943 INFO L226 Difference]: Without dead ends: 606 [2023-11-29 03:11:52,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:11:52,945 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 99 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:52,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 749 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:11:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-29 03:11:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2023-11-29 03:11:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 517 states have (on average 1.2379110251450678) internal successors, (640), 520 states have internal predecessors, (640), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2023-11-29 03:11:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 790 transitions. [2023-11-29 03:11:52,977 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 790 transitions. Word has length 179 [2023-11-29 03:11:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:52,977 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 790 transitions. [2023-11-29 03:11:52,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:11:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 790 transitions. [2023-11-29 03:11:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:11:52,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:52,979 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:52,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:11:52,979 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:52,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2023-11-29 03:11:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503202803] [2023-11-29 03:11:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:11:53,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:11:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:11:53,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:11:53,131 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:11:53,132 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:11:53,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 03:11:53,136 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:53,139 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:11:53,179 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-29 03:11:53,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 03:11:53,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated [2023-11-29 03:11:53,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 03:11:53,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-29 03:11:53,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated [2023-11-29 03:11:53,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 03:11:53,182 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 03:11:53,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-29 03:11:53,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 03:11:53,184 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 03:11:53,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-29 03:11:53,185 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-29 03:11:53,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-11-29 03:11:53,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-29 03:11:53,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-29 03:11:53,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 03:11:53,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-29 03:11:53,189 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-29 03:11:53,189 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-29 03:11:53,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-29 03:11:53,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 03:11:53,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-29 03:11:53,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-29 03:11:53,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-29 03:11:53,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-29 03:11:53,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated [2023-11-29 03:11:53,193 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-29 03:11:53,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:11:53,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 03:11:53,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 03:11:53,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:11:53,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 03:11:53,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated [2023-11-29 03:11:53,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated [2023-11-29 03:11:53,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated [2023-11-29 03:11:53,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated [2023-11-29 03:11:53,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated [2023-11-29 03:11:53,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 03:11:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 03:11:53,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 03:11:53,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 03:11:53,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 03:11:53,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 03:11:53,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:11:53,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 03:11:53,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 03:11:53,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:11:53 BoogieIcfgContainer [2023-11-29 03:11:53,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:11:53,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:11:53,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:11:53,233 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:11:53,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:11:32" (3/4) ... [2023-11-29 03:11:53,235 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:11:53,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:11:53,236 INFO L158 Benchmark]: Toolchain (without parser) took 21519.69ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 112.3MB in the beginning and 358.4MB in the end (delta: -246.1MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,237 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:11:53,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.11ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 96.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.96ms. Allocated memory is still 159.4MB. Free memory was 96.1MB in the beginning and 92.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,238 INFO L158 Benchmark]: Boogie Preprocessor took 66.92ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 88.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,238 INFO L158 Benchmark]: RCFGBuilder took 643.48ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 56.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,238 INFO L158 Benchmark]: TraceAbstraction took 20401.04ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 125.9MB in the beginning and 358.4MB in the end (delta: -232.4MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2023-11-29 03:11:53,239 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 520.1MB. Free memory is still 358.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:11:53,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.11ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 96.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.96ms. Allocated memory is still 159.4MB. Free memory was 96.1MB in the beginning and 92.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.92ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 88.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 643.48ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 56.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20401.04ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 125.9MB in the beginning and 358.4MB in the end (delta: -232.4MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 520.1MB. Free memory is still 358.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] EXPR WrapperStruct00.var_1_5 [L124] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] RET updateVariables() [L136] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] EXPR WrapperStruct00.var_1_1 [L68] EXPR WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] COND FALSE !(WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) [L71] EXPR WrapperStruct00.var_1_3 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] COND TRUE WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] signed long int stepLocal_1 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1))); [L77] EXPR WrapperStruct00.var_1_17 [L77] signed char stepLocal_0 = WrapperStruct00.var_1_17; [L78] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) [L127] EXPR WrapperStruct00.var_1_5 [L127] EXPR WrapperStruct00.var_1_2 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) [L127] EXPR WrapperStruct00.var_1_1 [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_15 [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127-L128] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2175 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2170 mSDsluCounter, 11906 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8401 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3900 IncrementalHoareTripleChecker+Invalid, 4329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 3505 mSDtfsCounter, 3900 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1322 GetRequests, 1204 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=603occurred in iteration=23, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 842 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 4164 NumberOfCodeBlocks, 4164 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3962 ConstructedInterpolants, 0 QuantifiedInterpolants, 7456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 23276/23276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:11:53,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:11:55,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:11:55,289 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:11:55,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:11:55,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:11:55,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:11:55,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:11:55,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:11:55,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:11:55,324 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:11:55,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:11:55,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:11:55,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:11:55,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:11:55,327 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:11:55,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:11:55,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:11:55,329 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:11:55,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:11:55,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:11:55,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:11:55,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:11:55,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:11:55,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:11:55,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:11:55,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:11:55,334 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:11:55,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:11:55,335 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:11:55,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:11:55,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:11:55,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:11:55,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:11:55,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:11:55,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:11:55,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:11:55,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:11:55,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:11:55,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:11:55,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:11:55,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:11:55,339 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:11:55,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:11:55,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:11:55,340 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:11:55,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2023-11-29 03:11:55,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:11:55,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:11:55,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:11:55,658 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:11:55,659 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:11:55,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:11:58,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:11:58,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:11:58,661 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:11:58,671 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/f391c0984/3d6dfc1f04904b86b15eeee1113b74be/FLAG91c17b532 [2023-11-29 03:11:58,686 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/data/f391c0984/3d6dfc1f04904b86b15eeee1113b74be [2023-11-29 03:11:58,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:11:58,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:11:58,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:11:58,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:11:58,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:11:58,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:11:58" (1/1) ... [2023-11-29 03:11:58,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c925f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:58, skipping insertion in model container [2023-11-29 03:11:58,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:11:58" (1/1) ... [2023-11-29 03:11:58,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:11:58,902 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2023-11-29 03:11:58,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:11:58,972 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:11:58,985 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2023-11-29 03:11:59,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:11:59,048 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:11:59,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59 WrapperNode [2023-11-29 03:11:59,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:11:59,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:11:59,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:11:59,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:11:59,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,116 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 388 [2023-11-29 03:11:59,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:11:59,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:11:59,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:11:59,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:11:59,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,160 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-11-29 03:11:59,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:11:59,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:11:59,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:11:59,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:11:59,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (1/1) ... [2023-11-29 03:11:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:11:59,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:11:59,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:11:59,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:11:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:11:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 03:11:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 03:11:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 03:11:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 03:11:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:11:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:11:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:11:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:11:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-29 03:11:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-29 03:11:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:11:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:11:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:11:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:11:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 03:11:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 03:11:59,378 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:11:59,380 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:12:11,648 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:12:11,692 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:12:11,693 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:12:11,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:12:11 BoogieIcfgContainer [2023-11-29 03:12:11,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:12:11,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:12:11,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:12:11,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:12:11,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:11:58" (1/3) ... [2023-11-29 03:12:11,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151805c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:12:11, skipping insertion in model container [2023-11-29 03:12:11,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:11:59" (2/3) ... [2023-11-29 03:12:11,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151805c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:12:11, skipping insertion in model container [2023-11-29 03:12:11,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:12:11" (3/3) ... [2023-11-29 03:12:11,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2023-11-29 03:12:11,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:12:11,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:12:11,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:12:11,777 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@226d0752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:12:11,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:12:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:12:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:12:11,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:11,800 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:11,801 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:11,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-11-29 03:12:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112874706] [2023-11-29 03:12:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:11,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:11,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:11,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:12:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:12,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:12:12,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2023-11-29 03:12:12,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:12,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:12,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112874706] [2023-11-29 03:12:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112874706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:12,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:12,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:12:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667276487] [2023-11-29 03:12:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:12,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:12:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:12,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:12:12,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:12:12,433 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:12:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:12,488 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 03:12:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:12:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 03:12:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:12,499 INFO L225 Difference]: With dead ends: 223 [2023-11-29 03:12:12,500 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:12:12,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:12:12,508 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:12,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:12:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:12:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 03:12:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:12:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 03:12:12,559 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 03:12:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:12,560 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 03:12:12,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 03:12:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 03:12:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:12:12,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:12,565 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:12,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:12:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:12,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:12,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-11-29 03:12:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101931448] [2023-11-29 03:12:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:12,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 [2023-11-29 03:12:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:12,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:12,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:12:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:13,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:12:13,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:13,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:13,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101931448] [2023-11-29 03:12:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101931448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:13,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:12:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468631902] [2023-11-29 03:12:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:12:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:12:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:12:13,240 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:13,298 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2023-11-29 03:12:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:12:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 03:12:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:13,302 INFO L225 Difference]: With dead ends: 219 [2023-11-29 03:12:13,303 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 03:12:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:12:13,306 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:13,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:12:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 03:12:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 03:12:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:12:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2023-11-29 03:12:13,321 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 166 [2023-11-29 03:12:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:13,324 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2023-11-29 03:12:13,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2023-11-29 03:12:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 03:12:13,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:13,328 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:13,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:12:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:13,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:13,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1403213728, now seen corresponding path program 1 times [2023-11-29 03:12:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718460775] [2023-11-29 03:12:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:13,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:13,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:12:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:13,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:12:13,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:14,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:14,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718460775] [2023-11-29 03:12:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718460775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:14,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:14,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:12:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183633226] [2023-11-29 03:12:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:14,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:12:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:12:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:12:14,006 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:14,102 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2023-11-29 03:12:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:12:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 03:12:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:14,106 INFO L225 Difference]: With dead ends: 241 [2023-11-29 03:12:14,106 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 03:12:14,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:12:14,109 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:14,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 475 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:12:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 03:12:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2023-11-29 03:12:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:12:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-11-29 03:12:14,123 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 168 [2023-11-29 03:12:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:14,124 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-11-29 03:12:14,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-11-29 03:12:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 03:12:14,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:14,128 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:14,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:12:14,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:14,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:14,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash -165501938, now seen corresponding path program 1 times [2023-11-29 03:12:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025318493] [2023-11-29 03:12:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:14,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:14,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:14,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:12:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:14,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:12:14,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:14,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 03:12:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:15,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:15,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025318493] [2023-11-29 03:12:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025318493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:15,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:12:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221966288] [2023-11-29 03:12:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:15,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:12:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:12:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:12:15,492 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:18,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:21,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:23,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:24,537 INFO L93 Difference]: Finished difference Result 333 states and 483 transitions. [2023-11-29 03:12:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:12:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2023-11-29 03:12:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:24,540 INFO L225 Difference]: With dead ends: 333 [2023-11-29 03:12:24,540 INFO L226 Difference]: Without dead ends: 223 [2023-11-29 03:12:24,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:12:24,541 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 94 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:24,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 360 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-11-29 03:12:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-29 03:12:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2023-11-29 03:12:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:12:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2023-11-29 03:12:24,570 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 170 [2023-11-29 03:12:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:24,570 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2023-11-29 03:12:24,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2023-11-29 03:12:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 03:12:24,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:24,573 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:24,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:12:24,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:24,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:24,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1516518554, now seen corresponding path program 1 times [2023-11-29 03:12:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44100766] [2023-11-29 03:12:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:24,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:24,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:24,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:12:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:25,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:12:25,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:25,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:25,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44100766] [2023-11-29 03:12:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44100766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:25,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:25,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:12:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231966317] [2023-11-29 03:12:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:25,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:12:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:12:25,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:12:25,168 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:25,218 INFO L93 Difference]: Finished difference Result 321 states and 465 transitions. [2023-11-29 03:12:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:12:25,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 03:12:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:25,221 INFO L225 Difference]: With dead ends: 321 [2023-11-29 03:12:25,221 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 03:12:25,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:12:25,223 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:25,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:12:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 03:12:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2023-11-29 03:12:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:12:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2023-11-29 03:12:25,247 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 173 [2023-11-29 03:12:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:25,248 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 262 transitions. [2023-11-29 03:12:25,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2023-11-29 03:12:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:12:25,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:25,251 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:25,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 03:12:25,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:25,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:25,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-11-29 03:12:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702226214] [2023-11-29 03:12:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:25,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:25,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:25,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 03:12:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:25,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:12:25,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:25,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 03:12:26,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 03:12:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:26,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:26,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702226214] [2023-11-29 03:12:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702226214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:12:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067119257] [2023-11-29 03:12:26,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:26,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:12:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:12:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:12:26,287 INFO L87 Difference]: Start difference. First operand 182 states and 262 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:29,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:31,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:35,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:39,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:42,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:46,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:46,444 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2023-11-29 03:12:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:12:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:12:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:46,451 INFO L225 Difference]: With dead ends: 491 [2023-11-29 03:12:46,451 INFO L226 Difference]: Without dead ends: 367 [2023-11-29 03:12:46,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:12:46,452 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 387 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:46,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1690 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 749 Invalid, 1 Unknown, 0 Unchecked, 19.6s Time] [2023-11-29 03:12:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-29 03:12:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 221. [2023-11-29 03:12:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 172 states have internal predecessors, (222), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:12:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2023-11-29 03:12:46,475 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 175 [2023-11-29 03:12:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:46,476 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2023-11-29 03:12:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2023-11-29 03:12:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:12:46,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:46,479 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:46,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 03:12:46,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:46,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:46,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-11-29 03:12:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:12:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647370853] [2023-11-29 03:12:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:12:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:12:46,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:12:46,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:12:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:47,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:12:47,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:12:47,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:12:47,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:12:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647370853] [2023-11-29 03:12:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647370853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:12:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:12:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:12:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581627961] [2023-11-29 03:12:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:12:47,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:12:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:12:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:12:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:12:47,226 INFO L87 Difference]: Start difference. First operand 221 states and 314 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:12:51,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:55,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:12:58,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:00,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:02,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:07,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:07,710 INFO L93 Difference]: Finished difference Result 466 states and 650 transitions. [2023-11-29 03:13:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:13:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:13:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:07,716 INFO L225 Difference]: With dead ends: 466 [2023-11-29 03:13:07,716 INFO L226 Difference]: Without dead ends: 303 [2023-11-29 03:13:07,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:13:07,717 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 168 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:07,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 626 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 2 Unknown, 0 Unchecked, 20.4s Time] [2023-11-29 03:13:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-29 03:13:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 264. [2023-11-29 03:13:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 212 states have internal predecessors, (270), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:13:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2023-11-29 03:13:07,735 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 175 [2023-11-29 03:13:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:07,735 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2023-11-29 03:13:07,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:13:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2023-11-29 03:13:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:13:07,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:07,739 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:07,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 03:13:07,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:07,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:13:07,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1242159848, now seen corresponding path program 1 times [2023-11-29 03:13:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125080826] [2023-11-29 03:13:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:07,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:13:07,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 03:13:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:08,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 03:13:08,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:08,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:13:08,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-29 03:13:12,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:12,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2023-11-29 03:13:13,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:13,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2023-11-29 03:13:13,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 03:13:13,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:13,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 03:13:14,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:14,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2023-11-29 03:13:14,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:14,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2023-11-29 03:13:15,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:15,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2023-11-29 03:13:16,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:16,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 93 [2023-11-29 03:13:16,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:16,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2023-11-29 03:13:17,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:17,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2023-11-29 03:13:18,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 103 [2023-11-29 03:13:18,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:18,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:18,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 195 [2023-11-29 03:13:18,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2023-11-29 03:13:19,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:19,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 103 [2023-11-29 03:13:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 832 proven. 57 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:13:20,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:13:20,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125080826] [2023-11-29 03:13:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125080826] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:13:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:13:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 18 [2023-11-29 03:13:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039277924] [2023-11-29 03:13:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:13:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:13:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=223, Unknown=1, NotChecked=0, Total=306 [2023-11-29 03:13:20,318 INFO L87 Difference]: Start difference. First operand 264 states and 366 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:13:22,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:26,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:30,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:32,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:35,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:39,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:39,918 INFO L93 Difference]: Finished difference Result 604 states and 833 transitions. [2023-11-29 03:13:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:13:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:13:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:39,922 INFO L225 Difference]: With dead ends: 604 [2023-11-29 03:13:39,922 INFO L226 Difference]: Without dead ends: 402 [2023-11-29 03:13:39,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=87, Invalid=254, Unknown=1, NotChecked=0, Total=342 [2023-11-29 03:13:39,923 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 190 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:39,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 326 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 2 Unknown, 0 Unchecked, 19.6s Time] [2023-11-29 03:13:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-11-29 03:13:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 326. [2023-11-29 03:13:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.304029304029304) internal successors, (356), 274 states have internal predecessors, (356), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:13:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 452 transitions. [2023-11-29 03:13:39,943 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 452 transitions. Word has length 175 [2023-11-29 03:13:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:39,944 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 452 transitions. [2023-11-29 03:13:39,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:13:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 452 transitions. [2023-11-29 03:13:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:13:39,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:39,947 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:39,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:13:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:40,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:13:40,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-11-29 03:13:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338628778] [2023-11-29 03:13:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:40,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:13:40,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 03:13:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:40,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:13:40,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:13:40,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:40,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338628778] [2023-11-29 03:13:40,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338628778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:40,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:40,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:13:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183673999] [2023-11-29 03:13:40,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:13:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:13:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:13:40,660 INFO L87 Difference]: Start difference. First operand 326 states and 452 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:13:44,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:46,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:49,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:51,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:13:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:53,257 INFO L93 Difference]: Finished difference Result 601 states and 827 transitions. [2023-11-29 03:13:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:13:53,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:13:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:53,261 INFO L225 Difference]: With dead ends: 601 [2023-11-29 03:13:53,261 INFO L226 Difference]: Without dead ends: 337 [2023-11-29 03:13:53,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:13:53,262 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:53,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 578 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 1 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 03:13:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-29 03:13:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2023-11-29 03:13:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 244 states have (on average 1.290983606557377) internal successors, (315), 245 states have internal predecessors, (315), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:13:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 411 transitions. [2023-11-29 03:13:53,278 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 411 transitions. Word has length 175 [2023-11-29 03:13:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:53,279 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 411 transitions. [2023-11-29 03:13:53,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:13:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 411 transitions. [2023-11-29 03:13:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:13:53,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:53,281 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:53,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:13:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:53,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:13:53,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2023-11-29 03:13:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606972421] [2023-11-29 03:13:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:53,486 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:13:53,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:13:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:53,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:13:53,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:53,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:13:54,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 03:13:54,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-29 03:13:58,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-11-29 03:13:58,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:58,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2023-11-29 03:13:58,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:58,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2023-11-29 03:13:59,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:59,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:13:59,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:59,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2023-11-29 03:14:00,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:00,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2023-11-29 03:14:00,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2023-11-29 03:14:01,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:01,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2023-11-29 03:14:02,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:02,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2023-11-29 03:14:02,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:02,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2023-11-29 03:14:03,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 103 [2023-11-29 03:14:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:14:03,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:03,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 195 [2023-11-29 03:14:03,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 81 [2023-11-29 03:14:05,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:05,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 103 [2023-11-29 03:14:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 844 proven. 63 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-29 03:14:05,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:14:05,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:14:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606972421] [2023-11-29 03:14:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606972421] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:14:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2023-11-29 03:14:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028741233] [2023-11-29 03:14:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:14:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:14:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:14:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=247, Unknown=1, NotChecked=0, Total=342 [2023-11-29 03:14:05,770 INFO L87 Difference]: Start difference. First operand 297 states and 411 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:14:09,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:12,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:14,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:17,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:21,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:23,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:23,623 INFO L93 Difference]: Finished difference Result 700 states and 962 transitions. [2023-11-29 03:14:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:14:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:14:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:23,627 INFO L225 Difference]: With dead ends: 700 [2023-11-29 03:14:23,627 INFO L226 Difference]: Without dead ends: 465 [2023-11-29 03:14:23,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=99, Invalid=280, Unknown=1, NotChecked=0, Total=380 [2023-11-29 03:14:23,629 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 154 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:23,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 383 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2023-11-29 03:14:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-11-29 03:14:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 355. [2023-11-29 03:14:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 302 states have (on average 1.304635761589404) internal successors, (394), 303 states have internal predecessors, (394), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:14:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 490 transitions. [2023-11-29 03:14:23,649 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 490 transitions. Word has length 175 [2023-11-29 03:14:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 490 transitions. [2023-11-29 03:14:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:14:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 490 transitions. [2023-11-29 03:14:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:14:23,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:23,652 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:23,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 03:14:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:14:23,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:23,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-11-29 03:14:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:14:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252111896] [2023-11-29 03:14:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:14:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:14:23,854 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:14:23,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 03:14:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:24,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:14:24,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:14:24,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:14:24,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:14:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252111896] [2023-11-29 03:14:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252111896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:14:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:14:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:14:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030895863] [2023-11-29 03:14:24,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:14:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:14:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:14:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:14:24,336 INFO L87 Difference]: Start difference. First operand 355 states and 490 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:14:28,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:31,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:33,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:34,183 INFO L93 Difference]: Finished difference Result 657 states and 896 transitions. [2023-11-29 03:14:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:14:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:14:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:34,186 INFO L225 Difference]: With dead ends: 657 [2023-11-29 03:14:34,186 INFO L226 Difference]: Without dead ends: 364 [2023-11-29 03:14:34,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:14:34,187 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 67 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:34,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 714 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-11-29 03:14:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-29 03:14:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 295. [2023-11-29 03:14:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 244 states have (on average 1.2868852459016393) internal successors, (314), 244 states have internal predecessors, (314), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:14:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 406 transitions. [2023-11-29 03:14:34,200 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 406 transitions. Word has length 175 [2023-11-29 03:14:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:34,200 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 406 transitions. [2023-11-29 03:14:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:14:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 406 transitions. [2023-11-29 03:14:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:14:34,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:34,202 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:34,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 03:14:34,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:14:34,404 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:34,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1806691688, now seen corresponding path program 1 times [2023-11-29 03:14:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:14:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67980486] [2023-11-29 03:14:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:34,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:14:34,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:14:34,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:14:34,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 03:14:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:34,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 03:14:34,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:34,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:14:35,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-29 03:14:39,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:39,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-11-29 03:14:39,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:39,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-11-29 03:14:39,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2023-11-29 03:14:39,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:39,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2023-11-29 03:14:40,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:40,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2023-11-29 03:14:40,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:40,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2023-11-29 03:14:41,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:41,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2023-11-29 03:14:41,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:41,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2023-11-29 03:14:42,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:42,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 96 treesize of output 116 [2023-11-29 03:14:43,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:43,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 119 [2023-11-29 03:14:44,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 101 [2023-11-29 03:14:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:14:44,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:44,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 101 treesize of output 207 [2023-11-29 03:14:44,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2023-11-29 03:14:45,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:14:45,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 231 treesize of output 99 [2023-11-29 03:14:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 880 proven. 57 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:14:45,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:14:50,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:14:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67980486] [2023-11-29 03:14:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67980486] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:50,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:14:50,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 20 [2023-11-29 03:14:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272126217] [2023-11-29 03:14:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:14:50,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:14:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:14:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:14:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=270, Unknown=2, NotChecked=0, Total=380 [2023-11-29 03:14:50,215 INFO L87 Difference]: Start difference. First operand 295 states and 406 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:14:54,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:14:58,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:04,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:07,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:11,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:13,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:13,042 INFO L93 Difference]: Finished difference Result 560 states and 764 transitions. [2023-11-29 03:15:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:15:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:13,045 INFO L225 Difference]: With dead ends: 560 [2023-11-29 03:15:13,045 INFO L226 Difference]: Without dead ends: 327 [2023-11-29 03:15:13,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=114, Invalid=303, Unknown=3, NotChecked=0, Total=420 [2023-11-29 03:15:13,046 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 54 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:13,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 522 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 18.8s Time] [2023-11-29 03:15:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-29 03:15:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 293. [2023-11-29 03:15:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 242 states have internal predecessors, (309), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:15:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 401 transitions. [2023-11-29 03:15:13,060 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 401 transitions. Word has length 175 [2023-11-29 03:15:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:13,060 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 401 transitions. [2023-11-29 03:15:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:15:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2023-11-29 03:15:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:15:13,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:13,062 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:13,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 03:15:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:13,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2023-11-29 03:15:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585564586] [2023-11-29 03:15:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:13,266 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:13,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 03:15:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:13,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:15:13,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:13,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:15:13,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-11-29 03:15:14,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:14,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2023-11-29 03:15:18,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:18,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2023-11-29 03:15:18,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:18,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 03:15:18,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:18,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2023-11-29 03:15:19,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:19,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:19,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:19,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:19,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:19,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:20,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:20,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:20,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:20,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:20,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:20,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:21,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:21,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2023-11-29 03:15:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 69 [2023-11-29 03:15:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:21,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:21,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 135 [2023-11-29 03:15:21,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 52 [2023-11-29 03:15:22,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 151 treesize of output 67 [2023-11-29 03:15:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 556 proven. 63 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2023-11-29 03:15:22,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:15:23,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585564586] [2023-11-29 03:15:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585564586] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:15:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:15:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2023-11-29 03:15:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340159609] [2023-11-29 03:15:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2023-11-29 03:15:23,248 INFO L87 Difference]: Start difference. First operand 293 states and 401 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:15:26,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:30,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:33,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:35,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:35,949 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2023-11-29 03:15:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:35,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:15:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:35,952 INFO L225 Difference]: With dead ends: 546 [2023-11-29 03:15:35,952 INFO L226 Difference]: Without dead ends: 315 [2023-11-29 03:15:35,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=68, Invalid=203, Unknown=1, NotChecked=0, Total=272 [2023-11-29 03:15:35,953 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 45 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:35,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 500 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2023-11-29 03:15:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-29 03:15:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2023-11-29 03:15:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 240 states have (on average 1.2708333333333333) internal successors, (305), 240 states have internal predecessors, (305), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:15:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 397 transitions. [2023-11-29 03:15:35,965 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 397 transitions. Word has length 175 [2023-11-29 03:15:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:35,965 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 397 transitions. [2023-11-29 03:15:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:15:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 397 transitions. [2023-11-29 03:15:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:15:35,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:35,967 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:35,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 03:15:36,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:36,168 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:36,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2023-11-29 03:15:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:36,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626688441] [2023-11-29 03:15:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:36,170 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:36,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 03:15:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:36,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:15:36,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:15:36,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:36,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626688441] [2023-11-29 03:15:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626688441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:36,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759028777] [2023-11-29 03:15:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:36,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:36,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:36,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:36,627 INFO L87 Difference]: Start difference. First operand 291 states and 397 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:15:40,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:44,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:47,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:50,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:54,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:58,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:15:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:58,272 INFO L93 Difference]: Finished difference Result 576 states and 781 transitions. [2023-11-29 03:15:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:15:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:58,274 INFO L225 Difference]: With dead ends: 576 [2023-11-29 03:15:58,274 INFO L226 Difference]: Without dead ends: 347 [2023-11-29 03:15:58,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:58,275 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 92 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:58,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 669 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 2 Unknown, 0 Unchecked, 21.6s Time] [2023-11-29 03:15:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-29 03:15:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 291. [2023-11-29 03:15:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 240 states have internal predecessors, (304), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 03:15:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 396 transitions. [2023-11-29 03:15:58,292 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 396 transitions. Word has length 175 [2023-11-29 03:15:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:58,292 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 396 transitions. [2023-11-29 03:15:58,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:15:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 396 transitions. [2023-11-29 03:15:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:15:58,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:58,294 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:58,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:15:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:58,495 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:58,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2023-11-29 03:15:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299830084] [2023-11-29 03:15:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:58,497 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:58,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 03:15:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:59,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 03:15:59,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:59,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 03:15:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-11-29 03:15:59,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:59,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2023-11-29 03:16:00,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:00,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2023-11-29 03:16:00,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:00,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2023-11-29 03:16:00,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:00,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-11-29 03:16:00,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2023-11-29 03:16:01,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:01,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 60 [2023-11-29 03:16:01,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 73 [2023-11-29 03:16:02,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:02,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2023-11-29 03:16:02,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:02,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2023-11-29 03:16:03,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:03,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 44 [2023-11-29 03:16:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 732 proven. 96 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-11-29 03:16:03,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:16:04,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:04,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299830084] [2023-11-29 03:16:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299830084] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:16:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:16:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 27 [2023-11-29 03:16:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616488173] [2023-11-29 03:16:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:04,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:16:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:16:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:16:04,990 INFO L87 Difference]: Start difference. First operand 291 states and 396 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:07,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:12,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:15,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:19,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:19,553 INFO L93 Difference]: Finished difference Result 574 states and 778 transitions. [2023-11-29 03:16:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:16:19,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 03:16:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:19,557 INFO L225 Difference]: With dead ends: 574 [2023-11-29 03:16:19,557 INFO L226 Difference]: Without dead ends: 345 [2023-11-29 03:16:19,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:16:19,559 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 171 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:19,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1245 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2023-11-29 03:16:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-29 03:16:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 331. [2023-11-29 03:16:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 273 states have (on average 1.271062271062271) internal successors, (347), 274 states have internal predecessors, (347), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 03:16:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 449 transitions. [2023-11-29 03:16:19,579 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 449 transitions. Word has length 175 [2023-11-29 03:16:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:19,580 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 449 transitions. [2023-11-29 03:16:19,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 449 transitions. [2023-11-29 03:16:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 03:16:19,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:19,587 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:19,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 03:16:19,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:19,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:16:19,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:19,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1506119645, now seen corresponding path program 1 times [2023-11-29 03:16:19,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:19,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775129498] [2023-11-29 03:16:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:19,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:19,790 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:19,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 03:16:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:20,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:16:20,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:16:20,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:16:20,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775129498] [2023-11-29 03:16:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775129498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:16:20,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:16:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:16:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868333596] [2023-11-29 03:16:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:16:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:16:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:16:20,290 INFO L87 Difference]: Start difference. First operand 331 states and 449 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:21,163 INFO L93 Difference]: Finished difference Result 612 states and 828 transitions. [2023-11-29 03:16:21,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:16:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-11-29 03:16:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:21,165 INFO L225 Difference]: With dead ends: 612 [2023-11-29 03:16:21,165 INFO L226 Difference]: Without dead ends: 343 [2023-11-29 03:16:21,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:16:21,167 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:21,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 575 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:16:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-29 03:16:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2023-11-29 03:16:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 279 states have (on average 1.2652329749103943) internal successors, (353), 280 states have internal predecessors, (353), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 03:16:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 455 transitions. [2023-11-29 03:16:21,185 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 455 transitions. Word has length 177 [2023-11-29 03:16:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:21,186 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 455 transitions. [2023-11-29 03:16:21,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 455 transitions. [2023-11-29 03:16:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:16:21,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:21,188 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:21,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 03:16:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:21,388 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:16:21,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash -305973112, now seen corresponding path program 1 times [2023-11-29 03:16:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038024456] [2023-11-29 03:16:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:21,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:21,390 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:21,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 03:16:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:22,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:16:22,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:22,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:16:22,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-11-29 03:16:22,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:22,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2023-11-29 03:16:22,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 68 [2023-11-29 03:16:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:16:22,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 106 [2023-11-29 03:16:22,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 30 [2023-11-29 03:16:24,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:24,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 74 [2023-11-29 03:16:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 293 proven. 12 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2023-11-29 03:16:24,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 03:16:25,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038024456] [2023-11-29 03:16:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038024456] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:16:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:16:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 19 [2023-11-29 03:16:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057240940] [2023-11-29 03:16:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:16:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:25,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:16:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:16:25,114 INFO L87 Difference]: Start difference. First operand 337 states and 455 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:28,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:33,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:16:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:34,615 INFO L93 Difference]: Finished difference Result 608 states and 814 transitions. [2023-11-29 03:16:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:16:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2023-11-29 03:16:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:34,620 INFO L225 Difference]: With dead ends: 608 [2023-11-29 03:16:34,620 INFO L226 Difference]: Without dead ends: 606 [2023-11-29 03:16:34,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:16:34,621 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 100 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:34,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 759 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 298 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 03:16:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-29 03:16:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2023-11-29 03:16:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 517 states have (on average 1.2707930367504836) internal successors, (657), 520 states have internal predecessors, (657), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2023-11-29 03:16:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 807 transitions. [2023-11-29 03:16:34,651 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 807 transitions. Word has length 179 [2023-11-29 03:16:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:34,652 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 807 transitions. [2023-11-29 03:16:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 03:16:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 807 transitions. [2023-11-29 03:16:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:16:34,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:34,654 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:34,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 03:16:34,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:34,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:16:34,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2023-11-29 03:16:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:34,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680839180] [2023-11-29 03:16:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:34,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 [2023-11-29 03:16:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:34,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:34,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0612f7c-5040-4b0d-a203-c18303d706f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 03:16:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:53,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 03:16:53,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:53,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:53,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 03:16:54,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 03:16:54,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-11-29 03:16:55,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:55,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 93 [2023-11-29 03:16:56,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:56,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 106 [2023-11-29 03:16:57,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 119 [2023-11-29 03:16:58,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:58,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 175 treesize of output 132 [2023-11-29 03:17:00,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:00,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 190 treesize of output 135 [2023-11-29 03:17:01,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:01,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 185 treesize of output 145 [2023-11-29 03:17:02,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:02,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 200 treesize of output 148 [2023-11-29 03:17:03,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:03,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 195 treesize of output 158 [2023-11-29 03:17:05,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:05,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 205 treesize of output 171 [2023-11-29 03:17:16,494 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:09,999 WARN L293 SmtUtils]: Spent 33.47s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:19:20,229 WARN L293 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:25,741 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:34,128 WARN L293 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:39,212 WARN L293 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:51,466 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:58,470 WARN L293 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:09,224 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:19,844 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:24,859 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:36,627 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:43,256 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:51,431 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:20:56,804 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:21:29,140 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:21:35,090 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:21:45,483 WARN L293 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:21:51,367 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:06,732 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:16,223 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:24,397 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:32,575 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:44,670 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:22:52,797 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:00,903 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:07,572 WARN L293 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:18,156 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:31,227 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:39,535 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:23:47,152 WARN L293 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:10,290 WARN L293 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:17,141 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:23,499 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:31,673 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:36,927 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:24:46,276 WARN L293 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:25:20,777 WARN L293 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:25:27,915 WARN L293 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:25:37,380 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:25:43,337 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)