./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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 16cd25d5ee96e9312308044e9eb88c0f13c8398163b5a1d192ff53bfebca792b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:09:39,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:09:39,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:09:39,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:09:39,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:09:39,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:09:39,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:09:39,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:09:39,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:09:39,489 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:09:39,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:09:39,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:09:39,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:09:39,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:09:39,492 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:09:39,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:09:39,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:09:39,493 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:09:39,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:09:39,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:09:39,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:09:39,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:09:39,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:09:39,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:09:39,497 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:09:39,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:09:39,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:09:39,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:09:39,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:09:39,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:09:39,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:09:39,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:39,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:09:39,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:09:39,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:09:39,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:09:39,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:09:39,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:09:39,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:09:39,501 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:09:39,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:09:39,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:09:39,502 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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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 -> 16cd25d5ee96e9312308044e9eb88c0f13c8398163b5a1d192ff53bfebca792b [2023-11-29 04:09:39,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:09:39,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:09:39,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:09:39,766 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:09:39,766 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:09:39,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i [2023-11-29 04:09:42,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:09:42,684 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:09:42,685 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i [2023-11-29 04:09:42,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/data/15f81f5d0/3bbcd58a6fd54e5db0d0055f2714715a/FLAG3c8cd614b [2023-11-29 04:09:42,709 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/data/15f81f5d0/3bbcd58a6fd54e5db0d0055f2714715a [2023-11-29 04:09:42,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:09:42,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:09:42,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:42,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:09:42,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:09:42,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:42,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a5f4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42, skipping insertion in model container [2023-11-29 04:09:42,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:42,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:09:42,896 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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i[916,929] [2023-11-29 04:09:42,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:42,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:09:42,956 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_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-74.i[916,929] [2023-11-29 04:09:42,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:42,988 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:09:42,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42 WrapperNode [2023-11-29 04:09:42,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:42,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:42,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:09:42,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:09:42,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,034 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-29 04:09:43,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:43,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:09:43,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:09:43,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:09:43,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,056 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:09:43,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:09:43,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:09:43,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:09:43,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:09:43,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (1/1) ... [2023-11-29 04:09:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:09:43,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:09:43,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:09:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:09:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:09:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:09:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:09:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:09:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:09:43,227 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:09:43,229 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:09:43,457 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:09:43,495 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:09:43,495 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:09:43,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:43 BoogieIcfgContainer [2023-11-29 04:09:43,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:09:43,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:09:43,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:09:43,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:09:43,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:09:42" (1/3) ... [2023-11-29 04:09:43,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b0f0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:43, skipping insertion in model container [2023-11-29 04:09:43,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:42" (2/3) ... [2023-11-29 04:09:43,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b0f0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:43, skipping insertion in model container [2023-11-29 04:09:43,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:43" (3/3) ... [2023-11-29 04:09:43,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-74.i [2023-11-29 04:09:43,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:09:43,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:09:43,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:09:43,585 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;@383307ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:09:43,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:09:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 04:09:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 04:09:43,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:09:43,605 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:43,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:09:43,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash -377013824, now seen corresponding path program 1 times [2023-11-29 04:09:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253685377] [2023-11-29 04:09:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:10:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:10:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:10:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:10:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:10:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:10:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:10:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:10:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:10:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:10:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:10:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:10:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:10:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:10:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:10:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:10:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:10:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:10:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:10:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:10:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:10:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:10:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 04:10:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:10:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253685377] [2023-11-29 04:10:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253685377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:10:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313320654] [2023-11-29 04:10:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:10:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:10:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:10:02,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:10:02,175 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:10:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:10:02,492 INFO L93 Difference]: Finished difference Result 170 states and 319 transitions. [2023-11-29 04:10:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:10:02,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 130 [2023-11-29 04:10:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:10:02,505 INFO L225 Difference]: With dead ends: 170 [2023-11-29 04:10:02,506 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 04:10:02,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:10:02,512 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 85 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:10:02,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 316 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:10:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 04:10:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2023-11-29 04:10:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:10:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2023-11-29 04:10:02,576 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 130 [2023-11-29 04:10:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:10:02,577 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2023-11-29 04:10:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:10:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2023-11-29 04:10:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 04:10:02,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:10:02,582 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:02,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:10:02,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:10:02,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1397993538, now seen corresponding path program 1 times [2023-11-29 04:10:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:10:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60227566] [2023-11-29 04:10:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:10:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:10:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:10:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:10:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:10:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:10:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:10:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:10:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:10:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:10:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:10:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:10:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:10:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:10:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:10:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:10:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:10:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:10:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:10:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:10:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:10:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:10:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:10:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 04:10:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:10:02,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60227566] [2023-11-29 04:10:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60227566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:02,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:02,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:10:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377696929] [2023-11-29 04:10:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:10:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:10:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:10:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:10:02,944 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:10:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:10:03,101 INFO L93 Difference]: Finished difference Result 154 states and 235 transitions. [2023-11-29 04:10:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:10:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 130 [2023-11-29 04:10:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:10:03,105 INFO L225 Difference]: With dead ends: 154 [2023-11-29 04:10:03,105 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 04:10:03,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:10:03,108 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 50 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:10:03,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 236 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:10:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 04:10:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2023-11-29 04:10:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:10:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2023-11-29 04:10:03,132 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 130 [2023-11-29 04:10:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:10:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2023-11-29 04:10:03,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:10:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2023-11-29 04:10:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 04:10:03,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:10:03,136 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:10:03,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:10:03,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1197007290, now seen corresponding path program 1 times [2023-11-29 04:10:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:10:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87677967] [2023-11-29 04:10:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:10:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:11:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:11:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:11:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:11:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:11:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:11:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:11:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:11:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:11:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:11:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:11:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:11:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:11:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:11:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:11:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:11:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:11:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:11:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:11:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:11:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:11:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:11:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 04:11:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:11:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87677967] [2023-11-29 04:11:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87677967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:11:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612727335] [2023-11-29 04:11:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:07,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:11:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:11:07,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:11:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:11:07,567 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:11:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:11:09,501 INFO L93 Difference]: Finished difference Result 106 states and 158 transitions. [2023-11-29 04:11:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:11:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 131 [2023-11-29 04:11:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:11:09,504 INFO L225 Difference]: With dead ends: 106 [2023-11-29 04:11:09,504 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 04:11:09,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:11:09,506 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:11:09,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 346 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:11:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 04:11:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-11-29 04:11:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:11:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2023-11-29 04:11:09,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 131 [2023-11-29 04:11:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:11:09,528 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2023-11-29 04:11:09,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:11:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2023-11-29 04:11:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 04:11:09,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:11:09,531 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:11:09,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:11:09,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:11:09,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1557270311, now seen corresponding path program 1 times [2023-11-29 04:11:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:11:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199228535] [2023-11-29 04:11:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:11:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:11:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:11:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:11:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:11:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:11:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:11:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:11:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:11:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:11:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:11:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:11:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:11:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:11:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:11:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:11:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:11:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:11:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:11:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:11:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:11:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:11:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:11:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:11:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 04:11:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:11:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199228535] [2023-11-29 04:11:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199228535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:11:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:11:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:11:35,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535564153] [2023-11-29 04:11:35,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:11:35,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:11:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:11:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:11:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:11:35,031 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:11:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:11:37,050 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions. [2023-11-29 04:11:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:11:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 132 [2023-11-29 04:11:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:11:37,053 INFO L225 Difference]: With dead ends: 125 [2023-11-29 04:11:37,053 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 04:11:37,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:11:37,055 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:11:37,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 248 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:11:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 04:11:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2023-11-29 04:11:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:11:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2023-11-29 04:11:37,073 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 132 [2023-11-29 04:11:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:11:37,074 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2023-11-29 04:11:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:11:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2023-11-29 04:11:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 04:11:37,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:11:37,077 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:11:37,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:11:37,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:11:37,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1578826241, now seen corresponding path program 1 times [2023-11-29 04:11:37,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:11:37,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483864185] [2023-11-29 04:11:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:11:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:11:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:12:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:12:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:12:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:12:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:12:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:12:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:12:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:12:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:12:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:12:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:12:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:12:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:12:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:12:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:12:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:12:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:12:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:12:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:12:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:12:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:12:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:12:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 04:12:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483864185] [2023-11-29 04:12:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483864185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:12:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876798945] [2023-11-29 04:12:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:00,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:12:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:12:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:12:00,480 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:01,649 INFO L93 Difference]: Finished difference Result 122 states and 182 transitions. [2023-11-29 04:12:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:12:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 133 [2023-11-29 04:12:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:01,651 INFO L225 Difference]: With dead ends: 122 [2023-11-29 04:12:01,651 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:12:01,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:12:01,653 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:01,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 298 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:12:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:12:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2023-11-29 04:12:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:12:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2023-11-29 04:12:01,671 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 133 [2023-11-29 04:12:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:01,672 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2023-11-29 04:12:01,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2023-11-29 04:12:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-11-29 04:12:01,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:01,677 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:01,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:12:01,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:01,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 165686492, now seen corresponding path program 1 times [2023-11-29 04:12:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839028304] [2023-11-29 04:12:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:12:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:12:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:12:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:12:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:12:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:12:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:12:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:12:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:12:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:12:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:12:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:12:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:12:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:12:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:12:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:12:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:12:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:12:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:12:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:12:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:12:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:12:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:12:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 04:12:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:12:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:12:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 04:12:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 04:12:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 04:12:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 04:12:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 04:12:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 04:12:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 04:12:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 04:12:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-29 04:12:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-29 04:12:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-29 04:12:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 04:12:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 04:12:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 04:12:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 04:12:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 04:12:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 04:12:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 04:12:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3824 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3818 trivial. 0 not checked. [2023-11-29 04:12:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839028304] [2023-11-29 04:12:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839028304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:12:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855087248] [2023-11-29 04:12:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:27,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:27,887 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:29,929 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2023-11-29 04:12:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:12:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 261 [2023-11-29 04:12:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:29,932 INFO L225 Difference]: With dead ends: 120 [2023-11-29 04:12:29,932 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 04:12:29,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:12:29,933 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 31 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:29,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 337 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:12:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 04:12:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2023-11-29 04:12:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 04:12:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2023-11-29 04:12:29,949 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 261 [2023-11-29 04:12:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:29,950 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2023-11-29 04:12:29,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2023-11-29 04:12:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-11-29 04:12:29,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:29,955 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:29,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:12:29,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:29,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash 686254110, now seen corresponding path program 1 times [2023-11-29 04:12:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165117893] [2023-11-29 04:12:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:12:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:12:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:12:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:12:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:12:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:12:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:12:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:12:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:12:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:12:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:12:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:12:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:12:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:12:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:12:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:12:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:12:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:12:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:12:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:12:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:12:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:12:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 04:12:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 04:12:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 04:12:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 04:12:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 04:12:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 04:12:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 04:12:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 04:12:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 04:12:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 04:12:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 04:12:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 04:12:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-29 04:12:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-29 04:12:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-29 04:12:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 04:12:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 04:12:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 04:12:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 04:12:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 04:12:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 04:12:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 04:12:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3824 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3818 trivial. 0 not checked. [2023-11-29 04:12:52,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:52,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165117893] [2023-11-29 04:12:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165117893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:12:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951645852] [2023-11-29 04:12:52,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:52,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:52,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:52,220 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:54,128 INFO L93 Difference]: Finished difference Result 116 states and 174 transitions. [2023-11-29 04:12:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:12:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 262 [2023-11-29 04:12:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:54,129 INFO L225 Difference]: With dead ends: 116 [2023-11-29 04:12:54,129 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:12:54,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:12:54,132 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:54,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 319 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:12:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:12:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:12:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:12:54,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2023-11-29 04:12:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:54,133 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:12:54,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 04:12:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:12:54,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:12:54,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:12:54,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:12:54,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:13:10,927 WARN L293 SmtUtils]: Spent 16.78s on a formula simplification. DAG size of input: 214 DAG size of output: 323 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 04:13:13,566 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-29 04:13:13,566 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-29 04:13:13,566 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 64) no Hoare annotation was computed. [2023-11-29 04:13:13,566 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-29 04:13:13,566 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:13:13,566 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L103(lines 70 104) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-29 04:13:13,567 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 55) no Hoare annotation was computed. [2023-11-29 04:13:13,568 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 39 69) no Hoare annotation was computed. [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-11-29 04:13:13,568 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-29 04:13:13,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:13:13,569 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-29 04:13:13,570 INFO L895 garLoopResultBuilder]: At program point L115-2(lines 115 121) the Hoare annotation is: (let ((.cse16 (div ~var_1_15~0 256))) (let ((.cse22 (* 256 .cse16)) (.cse23 (* 256 (div ~var_1_14~0 256))) (.cse18 (* (div ~var_1_10~0 256) 256)) (.cse21 (= (* (div ~last_1_var_1_16~0 256) 256) ~last_1_var_1_16~0))) (let ((.cse14 (or (= (+ .cse23 ~var_1_10~0) (+ .cse18 ~var_1_14~0)) (and .cse21 (<= ~var_1_5~0 ~var_1_11~0)))) (.cse12 (= .cse22 ~var_1_15~0)) (.cse13 (= .cse23 ~var_1_14~0)) (.cse15 (= .cse18 ~var_1_10~0)) (.cse17 (div ~var_1_16~0 256))) (let ((.cse0 (= (+ .cse22 ~var_1_16~0) (+ (* .cse17 256) ~var_1_15~0))) (.cse1 (or (let ((.cse19 (< ~var_1_11~0 ~var_1_5~0)) (.cse20 (not .cse21))) (and (or (= ~var_1_10~0 (+ .cse18 1)) .cse19 .cse20) .cse14 (or (and .cse12 (not .cse13)) .cse19 .cse20))) .cse15)) (.cse2 (<= .cse16 .cse17)) (.cse3 (or (and (or (not .cse12) .cse13) .cse14) (not .cse15)))) (or (and (= ~var_1_16~0 1) (= ~last_1_var_1_16~0 1)) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse4 (<= ~var_1_5~0 ~var_1_4~0))) (or (and (<= ~var_1_4~0 ~var_1_3~0) .cse4) (let ((.cse5 (+ ~var_1_3~0 1))) (and (<= .cse5 ~var_1_4~0) (or (let ((.cse6 (+ ~var_1_2~0 1))) (and (<= .cse6 ~var_1_4~0) (or (< ~var_1_5~0 .cse5) (< ~var_1_5~0 .cse6)))) (and .cse4 (<= ~var_1_4~0 ~var_1_2~0)))))))) (let ((.cse11 (* 4294967295 ~var_1_8~0)) (.cse8 (* (div ~var_1_6~0 4294967296) 4294967296))) (let ((.cse7 (* (div ~var_1_1~0 4294967296) 4294967296)) (.cse10 (+ .cse11 ~var_1_7~0 .cse8)) (.cse9 (+ (* (div (+ .cse11 ~var_1_7~0) 4294967296) 4294967296) ~var_1_6~0))) (and .cse0 .cse1 .cse2 (or (= (+ ~var_1_6~0 .cse7) (+ ~var_1_1~0 .cse8)) (<= .cse9 .cse10)) .cse3 (or (= (+ ~var_1_1~0 ~var_1_8~0 (* (div (+ ~var_1_7~0 (* (- 1) ~var_1_8~0)) 4294967296) 4294967296)) (+ ~var_1_7~0 .cse7)) (< .cse10 .cse9)))))))))) [2023-11-29 04:13:13,570 INFO L899 garLoopResultBuilder]: For program point L115-3(lines 115 121) no Hoare annotation was computed. [2023-11-29 04:13:13,570 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-11-29 04:13:13,570 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 41 45) no Hoare annotation was computed. [2023-11-29 04:13:13,570 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-29 04:13:13,570 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-29 04:13:13,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:13:13,570 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-29 04:13:13,571 INFO L902 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: true [2023-11-29 04:13:13,571 INFO L902 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: true [2023-11-29 04:13:13,571 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-29 04:13:13,571 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 67) no Hoare annotation was computed. [2023-11-29 04:13:13,571 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 39 69) no Hoare annotation was computed. [2023-11-29 04:13:13,571 INFO L902 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: true [2023-11-29 04:13:13,571 INFO L902 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: true [2023-11-29 04:13:13,571 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 04:13:13,571 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:13:13,571 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:13:13,572 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:13:13,572 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:13:13,575 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:13:13,577 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:13:13,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:13:13 BoogieIcfgContainer [2023-11-29 04:13:13,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:13:13,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:13:13,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:13:13,598 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:13:13,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:43" (3/4) ... [2023-11-29 04:13:13,600 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:13:13,605 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:13:13,610 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 04:13:13,611 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 04:13:13,611 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:13:13,612 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:13:13,711 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:13:13,711 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:13:13,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:13:13,712 INFO L158 Benchmark]: Toolchain (without parser) took 210998.39ms. Allocated memory was 134.2MB in the beginning and 851.4MB in the end (delta: 717.2MB). Free memory was 95.7MB in the beginning and 470.5MB in the end (delta: -374.8MB). Peak memory consumption was 345.2MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,712 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:13:13,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.56ms. Allocated memory is still 134.2MB. Free memory was 95.7MB in the beginning and 83.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.87ms. Allocated memory is still 134.2MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,713 INFO L158 Benchmark]: Boogie Preprocessor took 36.00ms. Allocated memory is still 134.2MB. Free memory was 81.1MB in the beginning and 78.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,713 INFO L158 Benchmark]: RCFGBuilder took 424.65ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 60.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,714 INFO L158 Benchmark]: TraceAbstraction took 210098.04ms. Allocated memory was 134.2MB in the beginning and 851.4MB in the end (delta: 717.2MB). Free memory was 60.1MB in the beginning and 476.8MB in the end (delta: -416.7MB). Peak memory consumption was 477.8MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,714 INFO L158 Benchmark]: Witness Printer took 113.83ms. Allocated memory is still 851.4MB. Free memory was 476.8MB in the beginning and 470.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:13:13,716 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.18ms. Allocated memory is still 134.2MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.56ms. Allocated memory is still 134.2MB. Free memory was 95.7MB in the beginning and 83.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.87ms. Allocated memory is still 134.2MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.00ms. Allocated memory is still 134.2MB. Free memory was 81.1MB in the beginning and 78.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.65ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 60.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 210098.04ms. Allocated memory was 134.2MB in the beginning and 851.4MB in the end (delta: 717.2MB). Free memory was 60.1MB in the beginning and 476.8MB in the end (delta: -416.7MB). Peak memory consumption was 477.8MB. Max. memory is 16.1GB. * Witness Printer took 113.83ms. Allocated memory is still 851.4MB. Free memory was 476.8MB in the beginning and 470.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 210.0s, OverallIterations: 7, TraceHistogramMax: 44, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 2100 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1625 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1002 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 475 mSDtfsCounter, 1002 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=5, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 111 PreInvPairs, 160 NumberOfFragments, 473 HoareAnnotationTreeSize, 111 FomulaSimplifications, 427901 FormulaSimplificationTreeSizeReduction, 16.8s HoareSimplificationTime, 24 FomulaSimplificationsInter, 69405 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 180.0s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1172 ConstructedInterpolants, 0 QuantifiedInterpolants, 7286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 12268/12268 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((var_1_16 == 1) && (last_1_var_1_16 == 1)) || (((((((256 * (var_1_15 / 256)) + var_1_16) == (((var_1_16 / 256) * 256) + var_1_15)) && ((((((var_1_10 == (((var_1_10 / 256) * 256) + 1)) || (var_1_11 < var_1_5)) || !((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16))) && ((((256 * (var_1_14 / 256)) + var_1_10) == (((var_1_10 / 256) * 256) + var_1_14)) || ((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16) && (var_1_5 <= var_1_11)))) && (((((256 * (var_1_15 / 256)) == var_1_15) && !(((256 * (var_1_14 / 256)) == var_1_14))) || (var_1_11 < var_1_5)) || !((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16)))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((var_1_15 / 256) <= (var_1_16 / 256))) && (((!(((256 * (var_1_15 / 256)) == var_1_15)) || ((256 * (var_1_14 / 256)) == var_1_14)) && ((((256 * (var_1_14 / 256)) + var_1_10) == (((var_1_10 / 256) * 256) + var_1_14)) || ((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16) && (var_1_5 <= var_1_11)))) || !((((var_1_10 / 256) * 256) == var_1_10)))) && (((var_1_4 <= var_1_3) && (var_1_5 <= var_1_4)) || (((var_1_3 + 1) <= var_1_4) && ((((var_1_2 + 1) <= var_1_4) && ((var_1_5 < (var_1_3 + 1)) || (var_1_5 < (var_1_2 + 1)))) || ((var_1_5 <= var_1_4) && (var_1_4 <= var_1_2))))))) || ((((((((256 * (var_1_15 / 256)) + var_1_16) == (((var_1_16 / 256) * 256) + var_1_15)) && ((((((var_1_10 == (((var_1_10 / 256) * 256) + 1)) || (var_1_11 < var_1_5)) || !((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16))) && ((((256 * (var_1_14 / 256)) + var_1_10) == (((var_1_10 / 256) * 256) + var_1_14)) || ((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16) && (var_1_5 <= var_1_11)))) && (((((256 * (var_1_15 / 256)) == var_1_15) && !(((256 * (var_1_14 / 256)) == var_1_14))) || (var_1_11 < var_1_5)) || !((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16)))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((var_1_15 / 256) <= (var_1_16 / 256))) && (((var_1_6 + ((var_1_1 / 4294967296) * 4294967296)) == (var_1_1 + ((var_1_6 / 4294967296) * 4294967296))) || ((((((4294967295 * var_1_8) + var_1_7) / 4294967296) * 4294967296) + var_1_6) <= (((4294967295 * var_1_8) + var_1_7) + ((var_1_6 / 4294967296) * 4294967296))))) && (((!(((256 * (var_1_15 / 256)) == var_1_15)) || ((256 * (var_1_14 / 256)) == var_1_14)) && ((((256 * (var_1_14 / 256)) + var_1_10) == (((var_1_10 / 256) * 256) + var_1_14)) || ((((last_1_var_1_16 / 256) * 256) == last_1_var_1_16) && (var_1_5 <= var_1_11)))) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((var_1_1 + var_1_8) + (((var_1_7 + (-1 * var_1_8)) / 4294967296) * 4294967296)) == (var_1_7 + ((var_1_1 / 4294967296) * 4294967296))) || ((((4294967295 * var_1_8) + var_1_7) + ((var_1_6 / 4294967296) * 4294967296)) < (((((4294967295 * var_1_8) + var_1_7) / 4294967296) * 4294967296) + var_1_6))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:13:13,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf8c28ca-51f0-49d7-9daa-24c5bf0966ac/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 Writing output log to file Ultimate.log Result: TRUE