./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:10:26,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:10:26,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:10:26,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:10:26,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:10:26,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:10:26,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:10:26,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:10:26,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:10:26,950 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:10:26,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:10:26,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:10:26,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:10:26,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:10:26,953 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:10:26,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:10:26,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:10:26,955 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:10:26,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:10:26,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:10:26,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:10:26,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:10:26,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:10:26,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:10:26,958 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:10:26,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:10:26,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:10:26,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:10:26,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:10:26,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:10:26,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:10:26,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:10:26,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:10:26,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:10:26,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:10:26,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:10:26,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:10:26,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:10:26,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:10:26,962 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:10:26,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:10:26,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:10:26,963 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2023-11-29 07:10:27,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:10:27,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:10:27,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:10:27,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:10:27,231 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:10:27,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:10:30,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:10:30,287 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:10:30,288 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:10:30,300 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/c6b7480f5/939c5d8ad42c48e3860f1cf47dfca68c/FLAG4a56963fb [2023-11-29 07:10:30,315 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/c6b7480f5/939c5d8ad42c48e3860f1cf47dfca68c [2023-11-29 07:10:30,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:10:30,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:10:30,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:10:30,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:10:30,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:10:30,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418a4734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30, skipping insertion in model container [2023-11-29 07:10:30,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:10:30,507 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2023-11-29 07:10:30,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:10:30,599 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:10:30,612 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2023-11-29 07:10:30,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:10:30,673 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:10:30,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30 WrapperNode [2023-11-29 07:10:30,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:10:30,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:10:30,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:10:30,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:10:30,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,741 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 284 [2023-11-29 07:10:30,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:10:30,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:10:30,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:10:30,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:10:30,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,779 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 07:10:30,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:10:30,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:10:30,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:10:30,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:10:30,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (1/1) ... [2023-11-29 07:10:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:10:30,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:10:30,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:10:30,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:10:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:10:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:10:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:10:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:10:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:10:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:10:30,958 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:10:30,960 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:10:31,403 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:10:31,437 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:10:31,437 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:10:31,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:10:31 BoogieIcfgContainer [2023-11-29 07:10:31,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:10:31,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:10:31,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:10:31,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:10:31,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:10:30" (1/3) ... [2023-11-29 07:10:31,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c1970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:10:31, skipping insertion in model container [2023-11-29 07:10:31,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:30" (2/3) ... [2023-11-29 07:10:31,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c1970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:10:31, skipping insertion in model container [2023-11-29 07:10:31,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:10:31" (3/3) ... [2023-11-29 07:10:31,446 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:10:31,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:10:31,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:10:31,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:10:31,515 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;@52fc32b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:10:31,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:10:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:31,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:31,538 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:31,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:31,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 380239218, now seen corresponding path program 1 times [2023-11-29 07:10:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:31,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233475922] [2023-11-29 07:10:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233475922] [2023-11-29 07:10:32,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233475922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:10:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586459532] [2023-11-29 07:10:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:32,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:10:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:10:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:10:32,054 INFO L87 Difference]: Start difference. First operand has 103 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 07:10:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:32,104 INFO L93 Difference]: Finished difference Result 203 states and 364 transitions. [2023-11-29 07:10:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:10:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 211 [2023-11-29 07:10:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:32,116 INFO L225 Difference]: With dead ends: 203 [2023-11-29 07:10:32,116 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 07:10:32,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:10:32,124 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:32,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:10:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 07:10:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 07:10:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2023-11-29 07:10:32,175 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 162 transitions. Word has length 211 [2023-11-29 07:10:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:32,175 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 162 transitions. [2023-11-29 07:10:32,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 07:10:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 162 transitions. [2023-11-29 07:10:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:32,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:32,182 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:32,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:10:32,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:32,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash -204249826, now seen corresponding path program 1 times [2023-11-29 07:10:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009865458] [2023-11-29 07:10:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009865458] [2023-11-29 07:10:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009865458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:10:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463909099] [2023-11-29 07:10:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:10:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:10:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:32,528 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:32,599 INFO L93 Difference]: Finished difference Result 240 states and 389 transitions. [2023-11-29 07:10:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:10:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:32,604 INFO L225 Difference]: With dead ends: 240 [2023-11-29 07:10:32,604 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 07:10:32,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:32,608 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 62 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:32,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 302 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:10:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 07:10:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2023-11-29 07:10:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 179 transitions. [2023-11-29 07:10:32,628 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 179 transitions. Word has length 211 [2023-11-29 07:10:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:32,630 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 179 transitions. [2023-11-29 07:10:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 179 transitions. [2023-11-29 07:10:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:32,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:32,636 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:32,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:10:32,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash -63701216, now seen corresponding path program 1 times [2023-11-29 07:10:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396665323] [2023-11-29 07:10:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396665323] [2023-11-29 07:10:33,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396665323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:33,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:33,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:10:33,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618551836] [2023-11-29 07:10:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:33,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:10:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:10:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:10:33,967 INFO L87 Difference]: Start difference. First operand 112 states and 179 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:34,543 INFO L93 Difference]: Finished difference Result 375 states and 601 transitions. [2023-11-29 07:10:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 07:10:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:34,548 INFO L225 Difference]: With dead ends: 375 [2023-11-29 07:10:34,548 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 07:10:34,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2023-11-29 07:10:34,550 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 353 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:34,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 735 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:10:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 07:10:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 165. [2023-11-29 07:10:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.5648854961832062) internal successors, (205), 131 states have internal predecessors, (205), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 269 transitions. [2023-11-29 07:10:34,572 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 269 transitions. Word has length 211 [2023-11-29 07:10:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:34,573 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 269 transitions. [2023-11-29 07:10:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 269 transitions. [2023-11-29 07:10:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:34,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:34,578 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:34,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:10:34,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:34,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash 155153502, now seen corresponding path program 1 times [2023-11-29 07:10:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532796094] [2023-11-29 07:10:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532796094] [2023-11-29 07:10:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532796094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 07:10:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387956788] [2023-11-29 07:10:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:36,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 07:10:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 07:10:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:10:36,972 INFO L87 Difference]: Start difference. First operand 165 states and 269 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:38,841 INFO L93 Difference]: Finished difference Result 576 states and 916 transitions. [2023-11-29 07:10:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 07:10:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:38,847 INFO L225 Difference]: With dead ends: 576 [2023-11-29 07:10:38,848 INFO L226 Difference]: Without dead ends: 412 [2023-11-29 07:10:38,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2023-11-29 07:10:38,850 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 631 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:38,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 806 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 07:10:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-29 07:10:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 173. [2023-11-29 07:10:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 139 states have (on average 1.5755395683453237) internal successors, (219), 139 states have internal predecessors, (219), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 283 transitions. [2023-11-29 07:10:38,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 283 transitions. Word has length 211 [2023-11-29 07:10:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:38,871 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 283 transitions. [2023-11-29 07:10:38,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 283 transitions. [2023-11-29 07:10:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:38,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:38,875 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:38,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:10:38,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:38,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash -431652512, now seen corresponding path program 1 times [2023-11-29 07:10:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949907051] [2023-11-29 07:10:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949907051] [2023-11-29 07:10:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949907051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:10:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821562153] [2023-11-29 07:10:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:39,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:10:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:10:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:10:39,807 INFO L87 Difference]: Start difference. First operand 173 states and 283 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:40,148 INFO L93 Difference]: Finished difference Result 431 states and 694 transitions. [2023-11-29 07:10:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:10:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:40,153 INFO L225 Difference]: With dead ends: 431 [2023-11-29 07:10:40,154 INFO L226 Difference]: Without dead ends: 259 [2023-11-29 07:10:40,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:10:40,156 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 272 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:40,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 680 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:10:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-29 07:10:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 161. [2023-11-29 07:10:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 127 states have (on average 1.5511811023622046) internal successors, (197), 127 states have internal predecessors, (197), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:10:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 261 transitions. [2023-11-29 07:10:40,174 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 261 transitions. Word has length 211 [2023-11-29 07:10:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:40,175 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 261 transitions. [2023-11-29 07:10:40,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 261 transitions. [2023-11-29 07:10:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:40,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:40,180 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:40,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:10:40,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:40,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1869139550, now seen corresponding path program 1 times [2023-11-29 07:10:40,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231043363] [2023-11-29 07:10:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231043363] [2023-11-29 07:10:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231043363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:10:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358410373] [2023-11-29 07:10:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:10:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:10:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:10:42,847 INFO L87 Difference]: Start difference. First operand 161 states and 261 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:47,521 INFO L93 Difference]: Finished difference Result 687 states and 1088 transitions. [2023-11-29 07:10:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:10:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:47,525 INFO L225 Difference]: With dead ends: 687 [2023-11-29 07:10:47,526 INFO L226 Difference]: Without dead ends: 527 [2023-11-29 07:10:47,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-11-29 07:10:47,527 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 864 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:47,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1018 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 07:10:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-29 07:10:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 270. [2023-11-29 07:10:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 223 states have internal predecessors, (348), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:10:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 436 transitions. [2023-11-29 07:10:47,581 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 436 transitions. Word has length 211 [2023-11-29 07:10:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:47,582 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 436 transitions. [2023-11-29 07:10:47,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 436 transitions. [2023-11-29 07:10:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:47,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:47,586 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:47,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:10:47,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:47,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1839021732, now seen corresponding path program 1 times [2023-11-29 07:10:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084011540] [2023-11-29 07:10:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:47,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084011540] [2023-11-29 07:10:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084011540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:10:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205173393] [2023-11-29 07:10:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:48,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:10:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:10:48,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:10:48,865 INFO L87 Difference]: Start difference. First operand 270 states and 436 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:51,414 INFO L93 Difference]: Finished difference Result 1046 states and 1677 transitions. [2023-11-29 07:10:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 07:10:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:51,420 INFO L225 Difference]: With dead ends: 1046 [2023-11-29 07:10:51,420 INFO L226 Difference]: Without dead ends: 753 [2023-11-29 07:10:51,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 07:10:51,422 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 661 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:51,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1240 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 07:10:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2023-11-29 07:10:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 367. [2023-11-29 07:10:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 319 states have (on average 1.5956112852664577) internal successors, (509), 320 states have internal predecessors, (509), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:10:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 597 transitions. [2023-11-29 07:10:51,500 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 597 transitions. Word has length 211 [2023-11-29 07:10:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:51,500 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 597 transitions. [2023-11-29 07:10:51,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 597 transitions. [2023-11-29 07:10:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-29 07:10:51,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:51,504 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:51,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:10:51,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:51,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1414710496, now seen corresponding path program 1 times [2023-11-29 07:10:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640839794] [2023-11-29 07:10:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:51,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:51,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640839794] [2023-11-29 07:10:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640839794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:51,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:51,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:10:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168848726] [2023-11-29 07:10:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:51,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:10:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:10:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:10:51,849 INFO L87 Difference]: Start difference. First operand 367 states and 597 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:52,418 INFO L93 Difference]: Finished difference Result 950 states and 1538 transitions. [2023-11-29 07:10:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:10:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2023-11-29 07:10:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:52,423 INFO L225 Difference]: With dead ends: 950 [2023-11-29 07:10:52,423 INFO L226 Difference]: Without dead ends: 584 [2023-11-29 07:10:52,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:10:52,424 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 142 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 915 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:10:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-29 07:10:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 464. [2023-11-29 07:10:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 416 states have (on average 1.6201923076923077) internal successors, (674), 417 states have internal predecessors, (674), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:10:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 762 transitions. [2023-11-29 07:10:52,526 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 762 transitions. Word has length 211 [2023-11-29 07:10:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:52,527 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 762 transitions. [2023-11-29 07:10:52,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 762 transitions. [2023-11-29 07:10:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:10:52,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:52,531 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:10:52,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:52,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1757313996, now seen corresponding path program 1 times [2023-11-29 07:10:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922261552] [2023-11-29 07:10:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922261552] [2023-11-29 07:10:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922261552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:53,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:53,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:10:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433404221] [2023-11-29 07:10:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:10:53,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:10:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:10:53,430 INFO L87 Difference]: Start difference. First operand 464 states and 762 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:53,724 INFO L93 Difference]: Finished difference Result 1318 states and 2172 transitions. [2023-11-29 07:10:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:10:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:10:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:53,730 INFO L225 Difference]: With dead ends: 1318 [2023-11-29 07:10:53,730 INFO L226 Difference]: Without dead ends: 855 [2023-11-29 07:10:53,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:10:53,731 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 123 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:53,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 429 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:10:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2023-11-29 07:10:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 851. [2023-11-29 07:10:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 797 states have (on average 1.64366373902133) internal successors, (1310), 800 states have internal predecessors, (1310), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:10:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1406 transitions. [2023-11-29 07:10:53,817 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1406 transitions. Word has length 212 [2023-11-29 07:10:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:53,818 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1406 transitions. [2023-11-29 07:10:53,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1406 transitions. [2023-11-29 07:10:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:10:53,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:53,821 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:53,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:10:53,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:53,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 732214966, now seen corresponding path program 1 times [2023-11-29 07:10:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:53,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070894260] [2023-11-29 07:10:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070894260] [2023-11-29 07:10:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070894260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:54,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:10:54,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592416238] [2023-11-29 07:10:54,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:54,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:10:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:54,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:10:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:10:54,987 INFO L87 Difference]: Start difference. First operand 851 states and 1406 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:56,368 INFO L93 Difference]: Finished difference Result 3023 states and 4981 transitions. [2023-11-29 07:10:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 07:10:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:10:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:56,381 INFO L225 Difference]: With dead ends: 3023 [2023-11-29 07:10:56,382 INFO L226 Difference]: Without dead ends: 2131 [2023-11-29 07:10:56,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2023-11-29 07:10:56,384 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 633 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:56,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 840 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:10:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2023-11-29 07:10:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1653. [2023-11-29 07:10:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1546 states have (on average 1.6364812419146184) internal successors, (2530), 1552 states have internal predecessors, (2530), 96 states have call successors, (96), 10 states have call predecessors, (96), 10 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 07:10:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2722 transitions. [2023-11-29 07:10:56,616 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2722 transitions. Word has length 212 [2023-11-29 07:10:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:56,617 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2722 transitions. [2023-11-29 07:10:56,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2722 transitions. [2023-11-29 07:10:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:10:56,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:56,622 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:56,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:10:56,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:56,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 951069684, now seen corresponding path program 1 times [2023-11-29 07:10:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:56,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96151186] [2023-11-29 07:10:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96151186] [2023-11-29 07:10:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96151186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:10:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226108613] [2023-11-29 07:10:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:57,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:10:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:10:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:10:57,158 INFO L87 Difference]: Start difference. First operand 1653 states and 2722 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:57,807 INFO L93 Difference]: Finished difference Result 3973 states and 6523 transitions. [2023-11-29 07:10:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:10:57,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:10:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:57,821 INFO L225 Difference]: With dead ends: 3973 [2023-11-29 07:10:57,822 INFO L226 Difference]: Without dead ends: 2321 [2023-11-29 07:10:57,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:10:57,825 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 237 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:57,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 500 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:10:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2023-11-29 07:10:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2147. [2023-11-29 07:10:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 2003 states have (on average 1.6325511732401399) internal successors, (3270), 2010 states have internal predecessors, (3270), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2023-11-29 07:10:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3530 transitions. [2023-11-29 07:10:58,118 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3530 transitions. Word has length 212 [2023-11-29 07:10:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:58,118 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 3530 transitions. [2023-11-29 07:10:58,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3530 transitions. [2023-11-29 07:10:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:10:58,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:58,125 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:58,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 07:10:58,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:58,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1729360183, now seen corresponding path program 1 times [2023-11-29 07:10:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787770446] [2023-11-29 07:10:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787770446] [2023-11-29 07:10:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787770446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:10:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997183808] [2023-11-29 07:10:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:58,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:10:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:10:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:58,323 INFO L87 Difference]: Start difference. First operand 2147 states and 3530 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:58,941 INFO L93 Difference]: Finished difference Result 5227 states and 8494 transitions. [2023-11-29 07:10:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:10:58,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:10:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:58,960 INFO L225 Difference]: With dead ends: 5227 [2023-11-29 07:10:58,960 INFO L226 Difference]: Without dead ends: 3081 [2023-11-29 07:10:58,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:58,965 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 131 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:58,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 332 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:10:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2023-11-29 07:10:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2645. [2023-11-29 07:10:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2501 states have (on average 1.6297481007596961) internal successors, (4076), 2508 states have internal predecessors, (4076), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2023-11-29 07:10:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4336 transitions. [2023-11-29 07:10:59,266 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4336 transitions. Word has length 212 [2023-11-29 07:10:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:59,266 INFO L495 AbstractCegarLoop]: Abstraction has 2645 states and 4336 transitions. [2023-11-29 07:10:59,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:10:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4336 transitions. [2023-11-29 07:10:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:10:59,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:59,271 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:59,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 07:10:59,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:59,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1891327502, now seen corresponding path program 1 times [2023-11-29 07:10:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365080635] [2023-11-29 07:10:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:10:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:10:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:10:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:10:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:10:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:10:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:10:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:10:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:10:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:10:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:10:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:10:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:10:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:10:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:10:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:10:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:10:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:10:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:10:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:10:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:10:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:10:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:10:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:10:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:10:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:10:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:10:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:10:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:10:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:10:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:10:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:10:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:10:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365080635] [2023-11-29 07:10:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365080635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:10:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422492781] [2023-11-29 07:10:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:59,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:10:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:10:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:10:59,772 INFO L87 Difference]: Start difference. First operand 2645 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:01,337 INFO L93 Difference]: Finished difference Result 6555 states and 10665 transitions. [2023-11-29 07:11:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:11:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:11:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:01,354 INFO L225 Difference]: With dead ends: 6555 [2023-11-29 07:11:01,355 INFO L226 Difference]: Without dead ends: 3911 [2023-11-29 07:11:01,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:11:01,358 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 413 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:01,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 473 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:11:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2023-11-29 07:11:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 2757. [2023-11-29 07:11:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2613 states have (on average 1.6303099885189438) internal successors, (4260), 2620 states have internal predecessors, (4260), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2023-11-29 07:11:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 4520 transitions. [2023-11-29 07:11:01,787 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 4520 transitions. Word has length 212 [2023-11-29 07:11:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:01,787 INFO L495 AbstractCegarLoop]: Abstraction has 2757 states and 4520 transitions. [2023-11-29 07:11:01,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 4520 transitions. [2023-11-29 07:11:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:11:01,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:01,792 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:11:01,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:01,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1816833780, now seen corresponding path program 1 times [2023-11-29 07:11:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209353128] [2023-11-29 07:11:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209353128] [2023-11-29 07:11:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209353128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:11:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804816768] [2023-11-29 07:11:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:02,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:11:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:11:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:11:02,260 INFO L87 Difference]: Start difference. First operand 2757 states and 4520 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:03,041 INFO L93 Difference]: Finished difference Result 8227 states and 13444 transitions. [2023-11-29 07:11:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:11:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:11:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:03,072 INFO L225 Difference]: With dead ends: 8227 [2023-11-29 07:11:03,072 INFO L226 Difference]: Without dead ends: 5467 [2023-11-29 07:11:03,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:11:03,076 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 157 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:03,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 901 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:11:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2023-11-29 07:11:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 3055. [2023-11-29 07:11:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 2911 states have (on average 1.638612160769495) internal successors, (4770), 2918 states have internal predecessors, (4770), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2023-11-29 07:11:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 5030 transitions. [2023-11-29 07:11:03,426 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 5030 transitions. Word has length 212 [2023-11-29 07:11:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:03,427 INFO L495 AbstractCegarLoop]: Abstraction has 3055 states and 5030 transitions. [2023-11-29 07:11:03,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 5030 transitions. [2023-11-29 07:11:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-29 07:11:03,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:03,433 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:03,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:11:03,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:03,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash 766164858, now seen corresponding path program 1 times [2023-11-29 07:11:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170014506] [2023-11-29 07:11:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170014506] [2023-11-29 07:11:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170014506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:11:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120852703] [2023-11-29 07:11:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:03,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:11:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:11:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:03,561 INFO L87 Difference]: Start difference. First operand 3055 states and 5030 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:03,923 INFO L93 Difference]: Finished difference Result 6411 states and 10554 transitions. [2023-11-29 07:11:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:11:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2023-11-29 07:11:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:03,943 INFO L225 Difference]: With dead ends: 6411 [2023-11-29 07:11:03,943 INFO L226 Difference]: Without dead ends: 3357 [2023-11-29 07:11:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:03,948 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 55 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 357 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:11:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2023-11-29 07:11:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 2869. [2023-11-29 07:11:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2725 states have (on average 1.6073394495412845) internal successors, (4380), 2732 states have internal predecessors, (4380), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2023-11-29 07:11:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4640 transitions. [2023-11-29 07:11:04,346 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4640 transitions. Word has length 212 [2023-11-29 07:11:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:04,347 INFO L495 AbstractCegarLoop]: Abstraction has 2869 states and 4640 transitions. [2023-11-29 07:11:04,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4640 transitions. [2023-11-29 07:11:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:04,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:04,352 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:04,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 07:11:04,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:04,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash -363712473, now seen corresponding path program 1 times [2023-11-29 07:11:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777901228] [2023-11-29 07:11:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777901228] [2023-11-29 07:11:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777901228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:04,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:04,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431675621] [2023-11-29 07:11:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:04,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:11:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:11:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:11:04,551 INFO L87 Difference]: Start difference. First operand 2869 states and 4640 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:05,149 INFO L93 Difference]: Finished difference Result 6987 states and 11281 transitions. [2023-11-29 07:11:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:11:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:05,157 INFO L225 Difference]: With dead ends: 6987 [2023-11-29 07:11:05,157 INFO L226 Difference]: Without dead ends: 4119 [2023-11-29 07:11:05,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:05,161 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 375 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:05,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 631 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:11:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4119 states. [2023-11-29 07:11:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4119 to 3455. [2023-11-29 07:11:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3455 states, 3274 states have (on average 1.6010995723885155) internal successors, (5242), 3282 states have internal predecessors, (5242), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2023-11-29 07:11:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 5570 transitions. [2023-11-29 07:11:05,547 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 5570 transitions. Word has length 213 [2023-11-29 07:11:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:05,548 INFO L495 AbstractCegarLoop]: Abstraction has 3455 states and 5570 transitions. [2023-11-29 07:11:05,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 5570 transitions. [2023-11-29 07:11:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:05,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:05,551 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:05,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 07:11:05,552 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:05,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -577774880, now seen corresponding path program 1 times [2023-11-29 07:11:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94267464] [2023-11-29 07:11:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94267464] [2023-11-29 07:11:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94267464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:11:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896838873] [2023-11-29 07:11:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:11:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:11:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:11:05,811 INFO L87 Difference]: Start difference. First operand 3455 states and 5570 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:06,791 INFO L93 Difference]: Finished difference Result 7626 states and 12184 transitions. [2023-11-29 07:11:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:11:06,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:06,802 INFO L225 Difference]: With dead ends: 7626 [2023-11-29 07:11:06,802 INFO L226 Difference]: Without dead ends: 4172 [2023-11-29 07:11:06,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:11:06,806 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 380 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:06,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 387 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:11:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2023-11-29 07:11:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 3547. [2023-11-29 07:11:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3366 states have (on average 1.5935828877005347) internal successors, (5364), 3374 states have internal predecessors, (5364), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2023-11-29 07:11:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5692 transitions. [2023-11-29 07:11:07,185 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5692 transitions. Word has length 213 [2023-11-29 07:11:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:07,185 INFO L495 AbstractCegarLoop]: Abstraction has 3547 states and 5692 transitions. [2023-11-29 07:11:07,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5692 transitions. [2023-11-29 07:11:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:07,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:07,190 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:07,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 07:11:07,191 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:07,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash -97814752, now seen corresponding path program 1 times [2023-11-29 07:11:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90156038] [2023-11-29 07:11:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90156038] [2023-11-29 07:11:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90156038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:09,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:09,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 07:11:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834381154] [2023-11-29 07:11:09,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:11:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:09,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:11:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:11:09,749 INFO L87 Difference]: Start difference. First operand 3547 states and 5692 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:12,968 INFO L93 Difference]: Finished difference Result 6297 states and 10070 transitions. [2023-11-29 07:11:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:11:12,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:12,975 INFO L225 Difference]: With dead ends: 6297 [2023-11-29 07:11:12,975 INFO L226 Difference]: Without dead ends: 4005 [2023-11-29 07:11:12,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:11:12,979 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 763 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:12,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 788 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 07:11:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2023-11-29 07:11:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3559. [2023-11-29 07:11:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3559 states, 3378 states have (on average 1.5932504440497335) internal successors, (5382), 3386 states have internal predecessors, (5382), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2023-11-29 07:11:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 5710 transitions. [2023-11-29 07:11:13,437 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 5710 transitions. Word has length 213 [2023-11-29 07:11:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:13,438 INFO L495 AbstractCegarLoop]: Abstraction has 3559 states and 5710 transitions. [2023-11-29 07:11:13,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 5710 transitions. [2023-11-29 07:11:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:13,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:13,441 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:13,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 07:11:13,441 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:13,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1108932002, now seen corresponding path program 1 times [2023-11-29 07:11:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842386628] [2023-11-29 07:11:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842386628] [2023-11-29 07:11:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842386628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:11:15,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151786299] [2023-11-29 07:11:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:15,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:11:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:11:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:11:15,758 INFO L87 Difference]: Start difference. First operand 3559 states and 5710 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:18,747 INFO L93 Difference]: Finished difference Result 6028 states and 9665 transitions. [2023-11-29 07:11:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:11:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:18,755 INFO L225 Difference]: With dead ends: 6028 [2023-11-29 07:11:18,755 INFO L226 Difference]: Without dead ends: 3724 [2023-11-29 07:11:18,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:11:18,758 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 637 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:18,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1053 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 07:11:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2023-11-29 07:11:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3552. [2023-11-29 07:11:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 3371 states have (on average 1.5921091664194602) internal successors, (5367), 3379 states have internal predecessors, (5367), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2023-11-29 07:11:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 5695 transitions. [2023-11-29 07:11:19,108 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 5695 transitions. Word has length 213 [2023-11-29 07:11:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:19,108 INFO L495 AbstractCegarLoop]: Abstraction has 3552 states and 5695 transitions. [2023-11-29 07:11:19,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 5695 transitions. [2023-11-29 07:11:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:19,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:19,113 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:19,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 07:11:19,113 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:19,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1377678430, now seen corresponding path program 1 times [2023-11-29 07:11:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377495212] [2023-11-29 07:11:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377495212] [2023-11-29 07:11:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377495212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367430573] [2023-11-29 07:11:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:19,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:11:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:11:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:11:19,563 INFO L87 Difference]: Start difference. First operand 3552 states and 5695 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:20,243 INFO L93 Difference]: Finished difference Result 8156 states and 13077 transitions. [2023-11-29 07:11:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:20,252 INFO L225 Difference]: With dead ends: 8156 [2023-11-29 07:11:20,253 INFO L226 Difference]: Without dead ends: 4605 [2023-11-29 07:11:20,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:11:20,258 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 173 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:20,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 537 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:11:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2023-11-29 07:11:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 3615. [2023-11-29 07:11:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3615 states, 3400 states have (on average 1.5870588235294119) internal successors, (5396), 3408 states have internal predecessors, (5396), 196 states have call successors, (196), 18 states have call predecessors, (196), 18 states have return successors, (196), 188 states have call predecessors, (196), 196 states have call successors, (196) [2023-11-29 07:11:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 5788 transitions. [2023-11-29 07:11:20,747 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 5788 transitions. Word has length 213 [2023-11-29 07:11:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:20,748 INFO L495 AbstractCegarLoop]: Abstraction has 3615 states and 5788 transitions. [2023-11-29 07:11:20,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 5788 transitions. [2023-11-29 07:11:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:20,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:20,751 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:20,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 07:11:20,751 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:20,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2015990271, now seen corresponding path program 1 times [2023-11-29 07:11:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717943513] [2023-11-29 07:11:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:20,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717943513] [2023-11-29 07:11:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717943513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:20,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:11:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855096371] [2023-11-29 07:11:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:20,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:11:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:11:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:20,915 INFO L87 Difference]: Start difference. First operand 3615 states and 5788 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:21,780 INFO L93 Difference]: Finished difference Result 7606 states and 12107 transitions. [2023-11-29 07:11:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:11:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:21,787 INFO L225 Difference]: With dead ends: 7606 [2023-11-29 07:11:21,787 INFO L226 Difference]: Without dead ends: 4014 [2023-11-29 07:11:21,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:21,791 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 128 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:21,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 384 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:11:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2023-11-29 07:11:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3092. [2023-11-29 07:11:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 2877 states have (on average 1.5578727841501565) internal successors, (4482), 2885 states have internal predecessors, (4482), 196 states have call successors, (196), 18 states have call predecessors, (196), 18 states have return successors, (196), 188 states have call predecessors, (196), 196 states have call successors, (196) [2023-11-29 07:11:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4874 transitions. [2023-11-29 07:11:22,270 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4874 transitions. Word has length 213 [2023-11-29 07:11:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:22,271 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 4874 transitions. [2023-11-29 07:11:22,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4874 transitions. [2023-11-29 07:11:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:22,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:22,273 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:22,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 07:11:22,273 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:22,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash -75182498, now seen corresponding path program 1 times [2023-11-29 07:11:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350039988] [2023-11-29 07:11:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:11:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:11:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:11:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:11:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:11:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:11:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:11:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:11:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:11:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:11:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:11:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:11:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:11:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:11:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:11:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:11:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:11:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:11:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:11:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:11:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 07:11:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:11:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 07:11:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 07:11:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 07:11:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 07:11:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 07:11:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 07:11:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 07:11:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 07:11:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 07:11:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:22,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350039988] [2023-11-29 07:11:22,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350039988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:22,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:11:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906658095] [2023-11-29 07:11:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:22,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:11:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:11:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:11:22,565 INFO L87 Difference]: Start difference. First operand 3092 states and 4874 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:24,488 INFO L93 Difference]: Finished difference Result 8734 states and 13750 transitions. [2023-11-29 07:11:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:11:24,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2023-11-29 07:11:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:24,502 INFO L225 Difference]: With dead ends: 8734 [2023-11-29 07:11:24,503 INFO L226 Difference]: Without dead ends: 5706 [2023-11-29 07:11:24,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:11:24,509 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 314 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:24,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 817 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 07:11:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2023-11-29 07:11:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5051. [2023-11-29 07:11:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4674 states have (on average 1.5468549422336328) internal successors, (7230), 4684 states have internal predecessors, (7230), 348 states have call successors, (348), 28 states have call predecessors, (348), 28 states have return successors, (348), 338 states have call predecessors, (348), 348 states have call successors, (348) [2023-11-29 07:11:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 7926 transitions. [2023-11-29 07:11:25,318 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 7926 transitions. Word has length 213 [2023-11-29 07:11:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:25,318 INFO L495 AbstractCegarLoop]: Abstraction has 5051 states and 7926 transitions. [2023-11-29 07:11:25,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 7926 transitions. [2023-11-29 07:11:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:11:25,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:25,321 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:25,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 07:11:25,321 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:25,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1999562597, now seen corresponding path program 1 times [2023-11-29 07:11:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443229747] [2023-11-29 07:11:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:11:25,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:11:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:11:25,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:11:25,546 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:11:25,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 07:11:25,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 07:11:25,551 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:25,554 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:11:25,646 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 07:11:25,647 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 07:11:25,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 07:11:25,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 07:11:25,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 07:11:25,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet30 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated [2023-11-29 07:11:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet30 could not be translated [2023-11-29 07:11:25,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated [2023-11-29 07:11:25,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:11:25 BoogieIcfgContainer [2023-11-29 07:11:25,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:11:25,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:11:25,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:11:25,680 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:11:25,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:10:31" (3/4) ... [2023-11-29 07:11:25,682 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:11:25,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:11:25,683 INFO L158 Benchmark]: Toolchain (without parser) took 55364.47ms. Allocated memory was 130.0MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 93.0MB in the beginning and 559.5MB in the end (delta: -466.6MB). Peak memory consumption was 504.0MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,684 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:11:25,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.41ms. Allocated memory is still 130.0MB. Free memory was 92.6MB in the beginning and 76.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 130.0MB. Free memory was 76.2MB in the beginning and 71.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,685 INFO L158 Benchmark]: Boogie Preprocessor took 75.06ms. Allocated memory is still 130.0MB. Free memory was 71.2MB in the beginning and 64.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,685 INFO L158 Benchmark]: RCFGBuilder took 619.87ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 64.9MB in the beginning and 114.6MB in the end (delta: -49.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,686 INFO L158 Benchmark]: TraceAbstraction took 54238.54ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 937.4MB). Free memory was 113.7MB in the beginning and 559.5MB in the end (delta: -445.9MB). Peak memory consumption was 492.1MB. Max. memory is 16.1GB. [2023-11-29 07:11:25,686 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.1GB. Free memory is still 559.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:11:25,688 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.16ms. Allocated memory is still 130.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.41ms. Allocated memory is still 130.0MB. Free memory was 92.6MB in the beginning and 76.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 130.0MB. Free memory was 76.2MB in the beginning and 71.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.06ms. Allocated memory is still 130.0MB. Free memory was 71.2MB in the beginning and 64.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 619.87ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 64.9MB in the beginning and 114.6MB in the end (delta: -49.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 54238.54ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 937.4MB). Free memory was 113.7MB in the beginning and 559.5MB in the end (delta: -445.9MB). Peak memory consumption was 492.1MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 1.1GB. Free memory is still 559.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short31 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of shiftRight at line 206, overapproximation of someUnaryDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 206. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned char var_1_38 = 8; [L45] unsigned char var_1_39 = 10; [L46] double var_1_40 = 8.35; [L47] double var_1_41 = 63.75; [L48] double var_1_42 = -0.125; [L49] double var_1_43 = -0.8; [L50] double var_1_44 = -0.5; [L51] unsigned short int var_1_45 = 50; [L52] unsigned char var_1_46 = 0; [L53] unsigned char var_1_47 = 5; [L54] unsigned char var_1_48 = 1; [L55] signed char var_1_49 = -16; [L56] signed char var_1_50 = 2; [L57] signed char var_1_51 = 16; [L58] signed char var_1_52 = 0; [L59] signed long int var_1_53 = 256; [L60] double var_1_54 = 1.25; [L61] unsigned long int var_1_55 = 5; [L62] signed long int last_1_var_1_1 = 64; [L63] unsigned char last_1_var_1_13 = 64; [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L202] last_1_var_1_1 = var_1_1 [L203] last_1_var_1_13 = var_1_13 [L213] RET updateLastVariables() [L214] CALL updateVariables() [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_16 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] var_1_18 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] var_1_19 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_20 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_21 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_22 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_23 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] var_1_28 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] var_1_38 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] var_1_41 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] var_1_42 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_43 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] var_1_44 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] var_1_47 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] var_1_50 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] var_1_51 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] var_1_52 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L67] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L68] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(\read(var_1_7)) [L75] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L77] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L80] var_1_32 = var_1_16 [L81] var_1_30 = var_1_32 [L82] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L84] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L86] COND TRUE var_1_11 >= var_1_30 [L87] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L90] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L98] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L99] COND TRUE ! var_1_7 [L100] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_1 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_13 | var_1_31 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] COND FALSE !((var_1_1 ^ var_1_32) < (var_1_13 | var_1_31)) [L111] var_1_33 = (((((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))) < 0 ) ? -((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))) : ((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L113] COND TRUE (-32 & var_1_38) > var_1_31 [L114] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND FALSE !(var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L125] COND TRUE var_1_44 <= (var_1_29 + var_1_43) [L126] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L136] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=-16, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L137] COND TRUE var_1_41 < var_1_29 [L138] var_1_49 = ((var_1_50 - var_1_51) + var_1_52) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] var_1_53 = var_1_32 [L143] var_1_54 = var_1_44 [L144] var_1_55 = var_1_13 [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] [L206-L207] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=0, var_1_26=-34, var_1_27=-63, var_1_28=29, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=224, var_1_38=224, var_1_39=224, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=68, var_1_46=0, var_1_47=0, var_1_48=224, var_1_49=4, var_1_50=63, var_1_51=59, var_1_52=0, var_1_53=68, var_1_54=506, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.1s, OverallIterations: 23, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7504 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7504 mSDsluCounter, 14283 SdHoareTripleChecker+Invalid, 12.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10155 mSDsCounter, 1556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6509 IncrementalHoareTripleChecker+Invalid, 8065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1556 mSolverCounterUnsat, 4128 mSDtfsCounter, 6509 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1720 GetRequests, 1538 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5051occurred in iteration=22, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 10847 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 4876 NumberOfCodeBlocks, 4876 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4641 ConstructedInterpolants, 0 QuantifiedInterpolants, 27517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 43648/43648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 07:11:25,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:11:27,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:11:27,990 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:11:27,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:11:27,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:11:28,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:11:28,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:11:28,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:11:28,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:11:28,032 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:11:28,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:11:28,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:11:28,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:11:28,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:11:28,036 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:11:28,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:11:28,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:11:28,038 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:11:28,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:11:28,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:11:28,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:11:28,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:11:28,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:11:28,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:11:28,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:11:28,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:11:28,043 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:11:28,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:11:28,044 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:11:28,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:11:28,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:11:28,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:11:28,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:11:28,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:11:28,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:11:28,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:11:28,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:11:28,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:11:28,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:11:28,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:11:28,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:11:28,049 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:11:28,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:11:28,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:11:28,050 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:11:28,050 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2023-11-29 07:11:28,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:11:28,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:11:28,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:11:28,416 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:11:28,417 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:11:28,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:11:31,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:11:31,446 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:11:31,446 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:11:31,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/d9c1d0417/caa8b21f3bd34a23802c0fd659bb2316/FLAGec2dd7811 [2023-11-29 07:11:31,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/data/d9c1d0417/caa8b21f3bd34a23802c0fd659bb2316 [2023-11-29 07:11:31,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:11:31,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:11:31,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:11:31,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:11:31,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:11:31,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576d6d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31, skipping insertion in model container [2023-11-29 07:11:31,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:11:31,645 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2023-11-29 07:11:31,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:11:31,766 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:11:31,780 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_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2023-11-29 07:11:31,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:11:31,841 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:11:31,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31 WrapperNode [2023-11-29 07:11:31,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:11:31,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:11:31,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:11:31,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:11:31,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,904 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2023-11-29 07:11:31,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:11:31,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:11:31,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:11:31,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:11:31,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,941 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 07:11:31,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:11:31,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:11:31,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:11:31,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:11:31,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (1/1) ... [2023-11-29 07:11:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:11:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:32,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:11:32,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:11:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:11:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:11:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:11:32,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:11:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:11:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:11:32,138 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:11:32,140 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:11:38,199 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:11:38,256 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:11:38,256 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:11:38,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:11:38 BoogieIcfgContainer [2023-11-29 07:11:38,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:11:38,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:11:38,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:11:38,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:11:38,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:11:31" (1/3) ... [2023-11-29 07:11:38,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210c8103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:11:38, skipping insertion in model container [2023-11-29 07:11:38,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:31" (2/3) ... [2023-11-29 07:11:38,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210c8103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:11:38, skipping insertion in model container [2023-11-29 07:11:38,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:11:38" (3/3) ... [2023-11-29 07:11:38,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2023-11-29 07:11:38,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:11:38,285 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:11:38,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:11:38,342 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;@6422714f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:11:38,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:11:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:11:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-11-29 07:11:38,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:38,368 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:38,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:38,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1531211019, now seen corresponding path program 1 times [2023-11-29 07:11:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275982818] [2023-11-29 07:11:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:38,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:38,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:38,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:38,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 07:11:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:39,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:11:39,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2023-11-29 07:11:39,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:11:39,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:11:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275982818] [2023-11-29 07:11:39,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275982818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:11:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570674810] [2023-11-29 07:11:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:11:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:11:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:11:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:11:39,195 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 07:11:43,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:11:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:43,312 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2023-11-29 07:11:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:11:43,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2023-11-29 07:11:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:43,353 INFO L225 Difference]: With dead ends: 173 [2023-11-29 07:11:43,353 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 07:11:43,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:11:43,361 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:43,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 07:11:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 07:11:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 07:11:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:11:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 135 transitions. [2023-11-29 07:11:43,406 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 135 transitions. Word has length 203 [2023-11-29 07:11:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:43,407 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 135 transitions. [2023-11-29 07:11:43,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 07:11:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 135 transitions. [2023-11-29 07:11:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-11-29 07:11:43,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:43,411 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:43,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:11:43,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:43,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:43,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1945518263, now seen corresponding path program 1 times [2023-11-29 07:11:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827503713] [2023-11-29 07:11:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:43,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:11:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:44,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:11:44,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:46,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:11:46,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:11:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827503713] [2023-11-29 07:11:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827503713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:46,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:11:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259076635] [2023-11-29 07:11:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:46,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:11:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:11:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:11:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:11:46,377 INFO L87 Difference]: Start difference. First operand 86 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:51,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:11:54,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:11:58,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:11:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:58,091 INFO L93 Difference]: Finished difference Result 257 states and 404 transitions. [2023-11-29 07:11:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2023-11-29 07:11:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:58,133 INFO L225 Difference]: With dead ends: 257 [2023-11-29 07:11:58,133 INFO L226 Difference]: Without dead ends: 172 [2023-11-29 07:11:58,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:11:58,137 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 121 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:58,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 442 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2023-11-29 07:11:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-29 07:11:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2023-11-29 07:11:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 07:11:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2023-11-29 07:11:58,195 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 203 [2023-11-29 07:11:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:58,197 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2023-11-29 07:11:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:11:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2023-11-29 07:11:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-11-29 07:11:58,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:58,203 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:58,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:11:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:58,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:58,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1127869813, now seen corresponding path program 1 times [2023-11-29 07:11:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:58,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563455291] [2023-11-29 07:11:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:58,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:58,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:58,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:58,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 07:11:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:59,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:11:59,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 07:11:59,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:11:59,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:11:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563455291] [2023-11-29 07:11:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563455291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:59,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:11:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965137961] [2023-11-29 07:11:59,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:59,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:11:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:11:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:11:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:59,153 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:12:02,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:12:06,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:12:10,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:12:11,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:12:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:12:11,851 INFO L93 Difference]: Finished difference Result 254 states and 398 transitions. [2023-11-29 07:12:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:12:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2023-11-29 07:12:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:12:11,892 INFO L225 Difference]: With dead ends: 254 [2023-11-29 07:12:11,892 INFO L226 Difference]: Without dead ends: 169 [2023-11-29 07:12:11,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:12:11,895 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 35 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:12:11,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 251 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2023-11-29 07:12:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-29 07:12:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2023-11-29 07:12:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 07:12:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2023-11-29 07:12:11,929 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 203 [2023-11-29 07:12:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:12:11,931 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2023-11-29 07:12:11,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 07:12:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2023-11-29 07:12:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-11-29 07:12:11,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:12:11,936 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:12:11,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 07:12:12,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:12:12,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:12:12,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:12:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash -460478089, now seen corresponding path program 1 times [2023-11-29 07:12:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:12:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204306716] [2023-11-29 07:12:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:12:12,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:12:12,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:12:12,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:12:12,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1ff0c8-ce03-4f3f-9ee5-cde6a8223bfe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 07:12:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:12,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 07:12:12,993 INFO L285 TraceCheckSpWp]: Computing forward predicates...