./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:43:50,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:43:50,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:43:50,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:43:50,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:43:50,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:43:50,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:43:50,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:43:50,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:43:50,876 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:43:50,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:43:50,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:43:50,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:43:50,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:43:50,879 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:43:50,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:43:50,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:43:50,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:43:50,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:43:50,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:43:50,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:43:50,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:43:50,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:43:50,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:43:50,886 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:43:50,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:43:50,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:43:50,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:43:50,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:43:50,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:43:50,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:43:50,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:43:50,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:43:50,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:43:50,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:43:50,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:43:50,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:43:50,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:43:50,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:43:50,890 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:43:50,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:43:50,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:43:50,891 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2023-11-29 03:43:51,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:43:51,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:43:51,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:43:51,150 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:43:51,151 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:43:51,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:43:53,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:43:54,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:43:54,198 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:43:54,211 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/a047ae747/9b2eb3d9152c423093c3bec6c62a0f02/FLAGe6d562448 [2023-11-29 03:43:54,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/a047ae747/9b2eb3d9152c423093c3bec6c62a0f02 [2023-11-29 03:43:54,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:43:54,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:43:54,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:43:54,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:43:54,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:43:54,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3b5b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54, skipping insertion in model container [2023-11-29 03:43:54,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,284 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:43:54,460 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2023-11-29 03:43:54,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:43:54,569 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:43:54,585 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2023-11-29 03:43:54,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:43:54,651 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:43:54,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54 WrapperNode [2023-11-29 03:43:54,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:43:54,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:43:54,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:43:54,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:43:54,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,728 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2023-11-29 03:43:54,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:43:54,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:43:54,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:43:54,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:43:54,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,775 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 03:43:54,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:43:54,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:43:54,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:43:54,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:43:54,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (1/1) ... [2023-11-29 03:43:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:43:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:43:54,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:43:54,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:43:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:43:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:43:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:43:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:43:54,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:43:54,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:43:54,990 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:43:54,992 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:43:55,435 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:43:55,473 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:43:55,473 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:43:55,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:43:55 BoogieIcfgContainer [2023-11-29 03:43:55,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:43:55,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:43:55,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:43:55,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:43:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:43:54" (1/3) ... [2023-11-29 03:43:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157fd773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:43:55, skipping insertion in model container [2023-11-29 03:43:55,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:43:54" (2/3) ... [2023-11-29 03:43:55,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157fd773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:43:55, skipping insertion in model container [2023-11-29 03:43:55,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:43:55" (3/3) ... [2023-11-29 03:43:55,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:43:55,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:43:55,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:43:55,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:43:55,564 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;@45095d27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:43:55,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:43:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 03:43:55,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:55,588 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:55,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:55,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1574993650, now seen corresponding path program 1 times [2023-11-29 03:43:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092822820] [2023-11-29 03:43:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092822820] [2023-11-29 03:43:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092822820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:43:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756006272] [2023-11-29 03:43:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:43:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:43:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:43:56,082 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:43:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:56,135 INFO L93 Difference]: Finished difference Result 169 states and 300 transitions. [2023-11-29 03:43:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:43:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2023-11-29 03:43:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:56,148 INFO L225 Difference]: With dead ends: 169 [2023-11-29 03:43:56,149 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:43:56,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:43:56,157 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 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, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:56,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:43:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:43:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 03:43:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 60 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 135 transitions. [2023-11-29 03:43:56,214 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 135 transitions. Word has length 154 [2023-11-29 03:43:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:56,215 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 135 transitions. [2023-11-29 03:43:56,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:43:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 135 transitions. [2023-11-29 03:43:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 03:43:56,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:56,221 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:56,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:43:56,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:56,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1670717850, now seen corresponding path program 1 times [2023-11-29 03:43:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101412562] [2023-11-29 03:43:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:56,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101412562] [2023-11-29 03:43:56,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101412562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:56,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:56,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:43:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267148569] [2023-11-29 03:43:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:56,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:43:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:43:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:56,555 INFO L87 Difference]: Start difference. First operand 84 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:56,623 INFO L93 Difference]: Finished difference Result 206 states and 335 transitions. [2023-11-29 03:43:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:43:56,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 03:43:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:56,628 INFO L225 Difference]: With dead ends: 206 [2023-11-29 03:43:56,628 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 03:43:56,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:56,632 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:56,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 250 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:43:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 03:43:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2023-11-29 03:43:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.5625) internal successors, (125), 80 states have internal predecessors, (125), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2023-11-29 03:43:56,650 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 154 [2023-11-29 03:43:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:56,652 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2023-11-29 03:43:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2023-11-29 03:43:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 03:43:56,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:56,657 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:43:56,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:56,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1811266460, now seen corresponding path program 1 times [2023-11-29 03:43:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570848379] [2023-11-29 03:43:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570848379] [2023-11-29 03:43:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570848379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:43:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035390952] [2023-11-29 03:43:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:57,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:43:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:43:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:43:57,191 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:57,648 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2023-11-29 03:43:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:43:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 03:43:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:57,654 INFO L225 Difference]: With dead ends: 329 [2023-11-29 03:43:57,655 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 03:43:57,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:43:57,658 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 236 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:57,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 384 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:43:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 03:43:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 122. [2023-11-29 03:43:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 98 states have internal predecessors, (154), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 198 transitions. [2023-11-29 03:43:57,682 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 198 transitions. Word has length 154 [2023-11-29 03:43:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:57,683 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 198 transitions. [2023-11-29 03:43:57,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2023-11-29 03:43:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 03:43:57,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:57,686 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:57,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:43:57,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:57,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 269801126, now seen corresponding path program 1 times [2023-11-29 03:43:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:57,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582100851] [2023-11-29 03:43:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582100851] [2023-11-29 03:43:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582100851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:43:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648610957] [2023-11-29 03:43:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:58,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:43:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:43:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:43:58,154 INFO L87 Difference]: Start difference. First operand 122 states and 198 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:58,431 INFO L93 Difference]: Finished difference Result 356 states and 576 transitions. [2023-11-29 03:43:58,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:43:58,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 03:43:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:58,435 INFO L225 Difference]: With dead ends: 356 [2023-11-29 03:43:58,435 INFO L226 Difference]: Without dead ends: 224 [2023-11-29 03:43:58,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 1 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 03:43:58,438 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 277 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:58,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 233 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:43:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-29 03:43:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2023-11-29 03:43:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.5611510791366907) internal successors, (217), 139 states have internal predecessors, (217), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 261 transitions. [2023-11-29 03:43:58,467 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 261 transitions. Word has length 155 [2023-11-29 03:43:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 261 transitions. [2023-11-29 03:43:58,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 261 transitions. [2023-11-29 03:43:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 03:43:58,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:58,471 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:58,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:43:58,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:58,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1445167776, now seen corresponding path program 1 times [2023-11-29 03:43:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883925745] [2023-11-29 03:43:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883925745] [2023-11-29 03:43:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883925745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:43:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351433620] [2023-11-29 03:43:58,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:58,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:43:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:43:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:58,653 INFO L87 Difference]: Start difference. First operand 163 states and 261 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:58,765 INFO L93 Difference]: Finished difference Result 377 states and 597 transitions. [2023-11-29 03:43:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:43:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 03:43:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:58,769 INFO L225 Difference]: With dead ends: 377 [2023-11-29 03:43:58,769 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 03:43:58,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:58,771 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 94 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:58,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 255 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:43:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 03:43:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2023-11-29 03:43:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 259 transitions. [2023-11-29 03:43:58,806 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 259 transitions. Word has length 155 [2023-11-29 03:43:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:58,806 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 259 transitions. [2023-11-29 03:43:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 259 transitions. [2023-11-29 03:43:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 03:43:58,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:58,809 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:43:58,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:58,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1535637208, now seen corresponding path program 1 times [2023-11-29 03:43:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076816182] [2023-11-29 03:43:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076816182] [2023-11-29 03:43:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076816182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:43:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471863065] [2023-11-29 03:43:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:58,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:43:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:43:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:58,962 INFO L87 Difference]: Start difference. First operand 163 states and 259 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:59,076 INFO L93 Difference]: Finished difference Result 397 states and 624 transitions. [2023-11-29 03:43:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:43:59,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 03:43:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:59,080 INFO L225 Difference]: With dead ends: 397 [2023-11-29 03:43:59,080 INFO L226 Difference]: Without dead ends: 235 [2023-11-29 03:43:59,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:43:59,082 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:59,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 255 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:43:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-29 03:43:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 177. [2023-11-29 03:43:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.522875816993464) internal successors, (233), 153 states have internal predecessors, (233), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2023-11-29 03:43:59,116 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 155 [2023-11-29 03:43:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:59,117 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2023-11-29 03:43:59,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2023-11-29 03:43:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:43:59,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:59,119 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:43:59,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:59,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -203317220, now seen corresponding path program 1 times [2023-11-29 03:43:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106962749] [2023-11-29 03:43:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:43:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:43:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:43:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:43:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:43:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:43:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:43:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:43:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:43:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:43:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:43:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:43:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:43:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:43:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:43:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:43:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:43:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:43:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:43:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:43:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:43:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:43:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:43:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:43:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:43:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:43:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106962749] [2023-11-29 03:43:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106962749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:43:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:43:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:43:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982674961] [2023-11-29 03:43:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:43:59,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:43:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:43:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:43:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:43:59,479 INFO L87 Difference]: Start difference. First operand 177 states and 277 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:43:59,935 INFO L93 Difference]: Finished difference Result 525 states and 821 transitions. [2023-11-29 03:43:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:43:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:43:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:43:59,940 INFO L225 Difference]: With dead ends: 525 [2023-11-29 03:43:59,940 INFO L226 Difference]: Without dead ends: 349 [2023-11-29 03:43:59,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 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 03:43:59,941 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 208 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:43:59,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 529 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:43:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-29 03:43:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 249. [2023-11-29 03:43:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.551111111111111) internal successors, (349), 225 states have internal predecessors, (349), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:43:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 393 transitions. [2023-11-29 03:43:59,980 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 393 transitions. Word has length 156 [2023-11-29 03:43:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:43:59,980 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 393 transitions. [2023-11-29 03:43:59,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:43:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 393 transitions. [2023-11-29 03:43:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:43:59,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:43:59,982 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:43:59,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:43:59,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:43:59,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:43:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 476741150, now seen corresponding path program 1 times [2023-11-29 03:43:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:43:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457962854] [2023-11-29 03:43:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:43:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457962854] [2023-11-29 03:44:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457962854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:44:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115039151] [2023-11-29 03:44:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:44:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:44:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:44:00,483 INFO L87 Difference]: Start difference. First operand 249 states and 393 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:01,612 INFO L93 Difference]: Finished difference Result 670 states and 1040 transitions. [2023-11-29 03:44:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:44:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:01,618 INFO L225 Difference]: With dead ends: 670 [2023-11-29 03:44:01,618 INFO L226 Difference]: Without dead ends: 421 [2023-11-29 03:44:01,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:44:01,620 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 371 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:01,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 886 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:44:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-29 03:44:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 265. [2023-11-29 03:44:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 241 states have internal predecessors, (371), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:44:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 415 transitions. [2023-11-29 03:44:01,692 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 415 transitions. Word has length 156 [2023-11-29 03:44:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:01,693 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 415 transitions. [2023-11-29 03:44:01,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 415 transitions. [2023-11-29 03:44:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:01,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:01,697 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:01,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:44:01,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:01,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2008755554, now seen corresponding path program 1 times [2023-11-29 03:44:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141429416] [2023-11-29 03:44:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141429416] [2023-11-29 03:44:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141429416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:44:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051066861] [2023-11-29 03:44:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:02,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:44:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:44:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:44:02,343 INFO L87 Difference]: Start difference. First operand 265 states and 415 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:44:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:02,731 INFO L93 Difference]: Finished difference Result 714 states and 1118 transitions. [2023-11-29 03:44:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 156 [2023-11-29 03:44:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:02,735 INFO L225 Difference]: With dead ends: 714 [2023-11-29 03:44:02,736 INFO L226 Difference]: Without dead ends: 450 [2023-11-29 03:44:02,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:44:02,737 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 125 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:02,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 559 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:44:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-29 03:44:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2023-11-29 03:44:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 401 states have (on average 1.5112219451371571) internal successors, (606), 401 states have internal predecessors, (606), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 03:44:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 694 transitions. [2023-11-29 03:44:02,864 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 694 transitions. Word has length 156 [2023-11-29 03:44:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:02,865 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 694 transitions. [2023-11-29 03:44:02,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:44:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 694 transitions. [2023-11-29 03:44:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:02,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:02,868 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:44:02,869 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:02,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1789900836, now seen corresponding path program 1 times [2023-11-29 03:44:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724976332] [2023-11-29 03:44:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724976332] [2023-11-29 03:44:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724976332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:03,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:44:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744337817] [2023-11-29 03:44:03,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:03,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:44:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:44:03,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:03,561 INFO L87 Difference]: Start difference. First operand 448 states and 694 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:04,205 INFO L93 Difference]: Finished difference Result 1041 states and 1596 transitions. [2023-11-29 03:44:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:44:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:04,211 INFO L225 Difference]: With dead ends: 1041 [2023-11-29 03:44:04,211 INFO L226 Difference]: Without dead ends: 594 [2023-11-29 03:44:04,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:44:04,213 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 92 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:04,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 944 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:44:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-11-29 03:44:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 494. [2023-11-29 03:44:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 447 states have (on average 1.4854586129753915) internal successors, (664), 447 states have internal predecessors, (664), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 03:44:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 752 transitions. [2023-11-29 03:44:04,361 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 752 transitions. Word has length 156 [2023-11-29 03:44:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:04,362 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 752 transitions. [2023-11-29 03:44:04,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 752 transitions. [2023-11-29 03:44:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:04,366 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:04,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:44:04,366 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:04,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1387565003, now seen corresponding path program 1 times [2023-11-29 03:44:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493839358] [2023-11-29 03:44:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493839358] [2023-11-29 03:44:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493839358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:44:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503331864] [2023-11-29 03:44:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:07,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:44:07,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:44:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:44:07,296 INFO L87 Difference]: Start difference. First operand 494 states and 752 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:09,706 INFO L93 Difference]: Finished difference Result 1535 states and 2323 transitions. [2023-11-29 03:44:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:44:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:09,716 INFO L225 Difference]: With dead ends: 1535 [2023-11-29 03:44:09,717 INFO L226 Difference]: Without dead ends: 1244 [2023-11-29 03:44:09,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:44:09,719 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 487 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:09,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 524 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:44:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2023-11-29 03:44:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 961. [2023-11-29 03:44:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 908 states have (on average 1.513215859030837) internal successors, (1374), 910 states have internal predecessors, (1374), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:44:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1470 transitions. [2023-11-29 03:44:09,879 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1470 transitions. Word has length 156 [2023-11-29 03:44:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:09,880 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1470 transitions. [2023-11-29 03:44:09,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1470 transitions. [2023-11-29 03:44:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:09,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:09,884 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:09,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:44:09,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:09,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash -937136034, now seen corresponding path program 1 times [2023-11-29 03:44:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104709474] [2023-11-29 03:44:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104709474] [2023-11-29 03:44:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104709474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:44:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798040231] [2023-11-29 03:44:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:10,024 INFO L87 Difference]: Start difference. First operand 961 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:10,245 INFO L93 Difference]: Finished difference Result 2215 states and 3395 transitions. [2023-11-29 03:44:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:10,254 INFO L225 Difference]: With dead ends: 2215 [2023-11-29 03:44:10,254 INFO L226 Difference]: Without dead ends: 1255 [2023-11-29 03:44:10,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:10,257 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 110 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:10,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 257 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:44:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2023-11-29 03:44:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 979. [2023-11-29 03:44:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 926 states have (on average 1.5075593952483801) internal successors, (1396), 928 states have internal predecessors, (1396), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:44:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1492 transitions. [2023-11-29 03:44:10,383 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1492 transitions. Word has length 156 [2023-11-29 03:44:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:10,383 INFO L495 AbstractCegarLoop]: Abstraction has 979 states and 1492 transitions. [2023-11-29 03:44:10,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1492 transitions. [2023-11-29 03:44:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:10,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:10,387 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:44:10,387 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:10,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 913257587, now seen corresponding path program 1 times [2023-11-29 03:44:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574028483] [2023-11-29 03:44:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574028483] [2023-11-29 03:44:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574028483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:44:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238807601] [2023-11-29 03:44:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:10,657 INFO L87 Difference]: Start difference. First operand 979 states and 1492 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:11,462 INFO L93 Difference]: Finished difference Result 2056 states and 3133 transitions. [2023-11-29 03:44:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:44:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:11,470 INFO L225 Difference]: With dead ends: 2056 [2023-11-29 03:44:11,471 INFO L226 Difference]: Without dead ends: 1465 [2023-11-29 03:44:11,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:44:11,472 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 190 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:11,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 431 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:44:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2023-11-29 03:44:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1057. [2023-11-29 03:44:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1004 states have (on average 1.5099601593625498) internal successors, (1516), 1006 states have internal predecessors, (1516), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:44:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1612 transitions. [2023-11-29 03:44:11,579 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1612 transitions. Word has length 156 [2023-11-29 03:44:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:11,580 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1612 transitions. [2023-11-29 03:44:11,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1612 transitions. [2023-11-29 03:44:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:11,584 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:11,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:44:11,584 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:11,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 520230577, now seen corresponding path program 1 times [2023-11-29 03:44:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330028872] [2023-11-29 03:44:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330028872] [2023-11-29 03:44:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330028872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:44:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335245075] [2023-11-29 03:44:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:11,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:44:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:44:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:44:11,830 INFO L87 Difference]: Start difference. First operand 1057 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:12,690 INFO L93 Difference]: Finished difference Result 2354 states and 3580 transitions. [2023-11-29 03:44:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:44:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:12,698 INFO L225 Difference]: With dead ends: 2354 [2023-11-29 03:44:12,698 INFO L226 Difference]: Without dead ends: 1298 [2023-11-29 03:44:12,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:12,701 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 324 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:12,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 377 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:44:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2023-11-29 03:44:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 997. [2023-11-29 03:44:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 944 states have (on average 1.4947033898305084) internal successors, (1411), 946 states have internal predecessors, (1411), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:44:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1507 transitions. [2023-11-29 03:44:12,807 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1507 transitions. Word has length 156 [2023-11-29 03:44:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:12,808 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1507 transitions. [2023-11-29 03:44:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1507 transitions. [2023-11-29 03:44:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:12,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:12,811 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:12,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:44:12,811 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:12,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1168710285, now seen corresponding path program 1 times [2023-11-29 03:44:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527009692] [2023-11-29 03:44:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527009692] [2023-11-29 03:44:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527009692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:44:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481645007] [2023-11-29 03:44:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:44:13,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:13,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:44:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:44:13,238 INFO L87 Difference]: Start difference. First operand 997 states and 1507 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:15,233 INFO L93 Difference]: Finished difference Result 3006 states and 4495 transitions. [2023-11-29 03:44:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:44:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:15,247 INFO L225 Difference]: With dead ends: 3006 [2023-11-29 03:44:15,248 INFO L226 Difference]: Without dead ends: 2010 [2023-11-29 03:44:15,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:44:15,251 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 377 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:15,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 734 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:44:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2023-11-29 03:44:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1499. [2023-11-29 03:44:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1394 states have (on average 1.4655667144906743) internal successors, (2043), 1398 states have internal predecessors, (2043), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2235 transitions. [2023-11-29 03:44:15,522 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2235 transitions. Word has length 156 [2023-11-29 03:44:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:15,522 INFO L495 AbstractCegarLoop]: Abstraction has 1499 states and 2235 transitions. [2023-11-29 03:44:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2235 transitions. [2023-11-29 03:44:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 03:44:15,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:15,525 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:44:15,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:15,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -673326029, now seen corresponding path program 1 times [2023-11-29 03:44:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:15,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759094678] [2023-11-29 03:44:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759094678] [2023-11-29 03:44:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759094678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:44:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456990062] [2023-11-29 03:44:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:44:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:44:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:44:15,972 INFO L87 Difference]: Start difference. First operand 1499 states and 2235 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:17,676 INFO L93 Difference]: Finished difference Result 4093 states and 6044 transitions. [2023-11-29 03:44:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:44:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 03:44:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:17,688 INFO L225 Difference]: With dead ends: 4093 [2023-11-29 03:44:17,688 INFO L226 Difference]: Without dead ends: 2595 [2023-11-29 03:44:17,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:44:17,691 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 423 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:17,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1067 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:44:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2023-11-29 03:44:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 1581. [2023-11-29 03:44:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1476 states have (on average 1.4600271002710028) internal successors, (2155), 1480 states have internal predecessors, (2155), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2347 transitions. [2023-11-29 03:44:17,933 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2347 transitions. Word has length 156 [2023-11-29 03:44:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:17,934 INFO L495 AbstractCegarLoop]: Abstraction has 1581 states and 2347 transitions. [2023-11-29 03:44:17,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2347 transitions. [2023-11-29 03:44:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:17,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:17,936 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:44:17,936 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:17,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -256613049, now seen corresponding path program 1 times [2023-11-29 03:44:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918364949] [2023-11-29 03:44:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918364949] [2023-11-29 03:44:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918364949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 03:44:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498978624] [2023-11-29 03:44:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:18,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:44:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:44:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:44:18,810 INFO L87 Difference]: Start difference. First operand 1581 states and 2347 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:20,364 INFO L93 Difference]: Finished difference Result 3957 states and 5703 transitions. [2023-11-29 03:44:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:44:20,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:20,375 INFO L225 Difference]: With dead ends: 3957 [2023-11-29 03:44:20,376 INFO L226 Difference]: Without dead ends: 2377 [2023-11-29 03:44:20,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:44:20,380 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 356 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:20,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1166 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:44:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2023-11-29 03:44:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1627. [2023-11-29 03:44:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1522 states have (on average 1.4553219448094612) internal successors, (2215), 1526 states have internal predecessors, (2215), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2407 transitions. [2023-11-29 03:44:20,664 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2407 transitions. Word has length 157 [2023-11-29 03:44:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:20,665 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 2407 transitions. [2023-11-29 03:44:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2407 transitions. [2023-11-29 03:44:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:20,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:20,668 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:20,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:44:20,669 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:20,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1418844037, now seen corresponding path program 1 times [2023-11-29 03:44:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:20,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070823005] [2023-11-29 03:44:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070823005] [2023-11-29 03:44:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070823005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:21,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 03:44:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507363894] [2023-11-29 03:44:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:21,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:44:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:44:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:44:21,578 INFO L87 Difference]: Start difference. First operand 1627 states and 2407 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:23,426 INFO L93 Difference]: Finished difference Result 3748 states and 5437 transitions. [2023-11-29 03:44:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:44:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:23,437 INFO L225 Difference]: With dead ends: 3748 [2023-11-29 03:44:23,437 INFO L226 Difference]: Without dead ends: 2122 [2023-11-29 03:44:23,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:44:23,440 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 435 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:23,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1123 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:44:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2023-11-29 03:44:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1645. [2023-11-29 03:44:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1540 states have (on average 1.4551948051948052) internal successors, (2241), 1544 states have internal predecessors, (2241), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2433 transitions. [2023-11-29 03:44:23,694 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2433 transitions. Word has length 157 [2023-11-29 03:44:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:23,695 INFO L495 AbstractCegarLoop]: Abstraction has 1645 states and 2433 transitions. [2023-11-29 03:44:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2433 transitions. [2023-11-29 03:44:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:23,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:23,697 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:23,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 03:44:23,697 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:23,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -116064439, now seen corresponding path program 1 times [2023-11-29 03:44:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130640874] [2023-11-29 03:44:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:23,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130640874] [2023-11-29 03:44:23,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130640874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:23,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:23,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100324879] [2023-11-29 03:44:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:23,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:44:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:44:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:44:23,894 INFO L87 Difference]: Start difference. First operand 1645 states and 2433 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:24,628 INFO L93 Difference]: Finished difference Result 3407 states and 5062 transitions. [2023-11-29 03:44:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:44:24,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:24,640 INFO L225 Difference]: With dead ends: 3407 [2023-11-29 03:44:24,640 INFO L226 Difference]: Without dead ends: 1763 [2023-11-29 03:44:24,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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 03:44:24,644 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 234 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:24,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 383 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2023-11-29 03:44:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1337. [2023-11-29 03:44:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1232 states have (on average 1.44237012987013) internal successors, (1777), 1236 states have internal predecessors, (1777), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1969 transitions. [2023-11-29 03:44:25,042 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1969 transitions. Word has length 157 [2023-11-29 03:44:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:25,043 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1969 transitions. [2023-11-29 03:44:25,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1969 transitions. [2023-11-29 03:44:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:25,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:25,046 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:25,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:44:25,046 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:25,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -573716998, now seen corresponding path program 1 times [2023-11-29 03:44:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478962231] [2023-11-29 03:44:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:25,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:25,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478962231] [2023-11-29 03:44:25,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478962231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:25,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:25,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:44:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502011288] [2023-11-29 03:44:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:25,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:44:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:44:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:44:25,673 INFO L87 Difference]: Start difference. First operand 1337 states and 1969 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:26,428 INFO L93 Difference]: Finished difference Result 3323 states and 4744 transitions. [2023-11-29 03:44:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:44:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:26,440 INFO L225 Difference]: With dead ends: 3323 [2023-11-29 03:44:26,440 INFO L226 Difference]: Without dead ends: 1987 [2023-11-29 03:44:26,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:44:26,443 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 117 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:26,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 530 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:44:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2023-11-29 03:44:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1344. [2023-11-29 03:44:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1239 states have (on average 1.439870863599677) internal successors, (1784), 1243 states have internal predecessors, (1784), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1976 transitions. [2023-11-29 03:44:26,720 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1976 transitions. Word has length 157 [2023-11-29 03:44:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:26,721 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1976 transitions. [2023-11-29 03:44:26,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1976 transitions. [2023-11-29 03:44:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:26,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:26,723 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:26,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:44:26,723 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:26,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1988768537, now seen corresponding path program 1 times [2023-11-29 03:44:26,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:26,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138352775] [2023-11-29 03:44:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138352775] [2023-11-29 03:44:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138352775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:44:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98333721] [2023-11-29 03:44:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:26,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:26,826 INFO L87 Difference]: Start difference. First operand 1344 states and 1976 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:27,291 INFO L93 Difference]: Finished difference Result 2913 states and 4276 transitions. [2023-11-29 03:44:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:27,300 INFO L225 Difference]: With dead ends: 2913 [2023-11-29 03:44:27,300 INFO L226 Difference]: Without dead ends: 1570 [2023-11-29 03:44:27,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:27,302 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 85 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:27,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:44:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2023-11-29 03:44:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1338. [2023-11-29 03:44:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1233 states have (on average 1.4290348742903487) internal successors, (1762), 1237 states have internal predecessors, (1762), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1954 transitions. [2023-11-29 03:44:27,685 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1954 transitions. Word has length 157 [2023-11-29 03:44:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:27,686 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1954 transitions. [2023-11-29 03:44:27,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1954 transitions. [2023-11-29 03:44:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 03:44:27,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:27,689 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:27,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 03:44:27,690 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:27,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1133343353, now seen corresponding path program 1 times [2023-11-29 03:44:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079595279] [2023-11-29 03:44:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079595279] [2023-11-29 03:44:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079595279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:44:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058023908] [2023-11-29 03:44:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:27,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:44:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:44:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:27,801 INFO L87 Difference]: Start difference. First operand 1338 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:28,146 INFO L93 Difference]: Finished difference Result 2923 states and 4208 transitions. [2023-11-29 03:44:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:44:28,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2023-11-29 03:44:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:28,157 INFO L225 Difference]: With dead ends: 2923 [2023-11-29 03:44:28,157 INFO L226 Difference]: Without dead ends: 1586 [2023-11-29 03:44:28,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:44:28,160 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 48 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:28,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 300 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:44:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2023-11-29 03:44:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1296. [2023-11-29 03:44:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1191 states have (on average 1.3870696893366918) internal successors, (1652), 1195 states have internal predecessors, (1652), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 03:44:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1844 transitions. [2023-11-29 03:44:28,495 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1844 transitions. Word has length 157 [2023-11-29 03:44:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:28,495 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 1844 transitions. [2023-11-29 03:44:28,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1844 transitions. [2023-11-29 03:44:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 03:44:28,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:28,498 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:28,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:44:28,498 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:28,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1366438661, now seen corresponding path program 1 times [2023-11-29 03:44:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:28,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912118225] [2023-11-29 03:44:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:29,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:29,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912118225] [2023-11-29 03:44:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912118225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:44:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941548536] [2023-11-29 03:44:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:29,132 INFO L87 Difference]: Start difference. First operand 1296 states and 1844 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:29,771 INFO L93 Difference]: Finished difference Result 2637 states and 3734 transitions. [2023-11-29 03:44:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:44:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2023-11-29 03:44:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:29,778 INFO L225 Difference]: With dead ends: 2637 [2023-11-29 03:44:29,778 INFO L226 Difference]: Without dead ends: 1335 [2023-11-29 03:44:29,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 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 03:44:29,781 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 184 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:29,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 368 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2023-11-29 03:44:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1318. [2023-11-29 03:44:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1201 states have (on average 1.373022481265612) internal successors, (1649), 1207 states have internal predecessors, (1649), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2023-11-29 03:44:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1857 transitions. [2023-11-29 03:44:30,179 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1857 transitions. Word has length 158 [2023-11-29 03:44:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:30,180 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1857 transitions. [2023-11-29 03:44:30,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1857 transitions. [2023-11-29 03:44:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 03:44:30,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:30,183 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:30,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:44:30,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:30,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1853595073, now seen corresponding path program 1 times [2023-11-29 03:44:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444138026] [2023-11-29 03:44:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444138026] [2023-11-29 03:44:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444138026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:44:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673808255] [2023-11-29 03:44:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:30,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:44:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:44:30,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:44:30,608 INFO L87 Difference]: Start difference. First operand 1318 states and 1857 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:32,020 INFO L93 Difference]: Finished difference Result 2891 states and 4072 transitions. [2023-11-29 03:44:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:44:32,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2023-11-29 03:44:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:32,030 INFO L225 Difference]: With dead ends: 2891 [2023-11-29 03:44:32,030 INFO L226 Difference]: Without dead ends: 1567 [2023-11-29 03:44:32,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:44:32,033 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 334 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:32,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 933 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:44:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2023-11-29 03:44:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1327. [2023-11-29 03:44:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1186 states have (on average 1.3650927487352444) internal successors, (1619), 1193 states have internal predecessors, (1619), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2023-11-29 03:44:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1871 transitions. [2023-11-29 03:44:32,361 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1871 transitions. Word has length 158 [2023-11-29 03:44:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:32,361 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1871 transitions. [2023-11-29 03:44:32,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1871 transitions. [2023-11-29 03:44:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 03:44:32,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:32,364 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 03:44:32,365 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:32,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2033239777, now seen corresponding path program 1 times [2023-11-29 03:44:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371667841] [2023-11-29 03:44:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371667841] [2023-11-29 03:44:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371667841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:32,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:44:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375194679] [2023-11-29 03:44:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:32,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:32,745 INFO L87 Difference]: Start difference. First operand 1327 states and 1871 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:33,257 INFO L93 Difference]: Finished difference Result 2911 states and 4085 transitions. [2023-11-29 03:44:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:44:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2023-11-29 03:44:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:33,261 INFO L225 Difference]: With dead ends: 2911 [2023-11-29 03:44:33,262 INFO L226 Difference]: Without dead ends: 1629 [2023-11-29 03:44:33,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:44:33,264 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 179 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:33,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 449 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:44:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2023-11-29 03:44:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1329. [2023-11-29 03:44:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1188 states have (on average 1.3644781144781144) internal successors, (1621), 1194 states have internal predecessors, (1621), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-11-29 03:44:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1873 transitions. [2023-11-29 03:44:33,601 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1873 transitions. Word has length 158 [2023-11-29 03:44:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:33,601 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1873 transitions. [2023-11-29 03:44:33,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1873 transitions. [2023-11-29 03:44:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 03:44:33,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:33,603 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 03:44:33,603 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:33,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1091679047, now seen corresponding path program 1 times [2023-11-29 03:44:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128351211] [2023-11-29 03:44:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128351211] [2023-11-29 03:44:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128351211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:44:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169682094] [2023-11-29 03:44:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:33,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:33,922 INFO L87 Difference]: Start difference. First operand 1329 states and 1873 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:34,796 INFO L93 Difference]: Finished difference Result 3128 states and 4437 transitions. [2023-11-29 03:44:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:44:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2023-11-29 03:44:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:34,802 INFO L225 Difference]: With dead ends: 3128 [2023-11-29 03:44:34,802 INFO L226 Difference]: Without dead ends: 1846 [2023-11-29 03:44:34,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:34,805 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 168 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:34,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 439 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:44:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2023-11-29 03:44:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1839. [2023-11-29 03:44:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1629 states have (on average 1.3658686310620012) internal successors, (2225), 1635 states have internal predecessors, (2225), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2023-11-29 03:44:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2609 transitions. [2023-11-29 03:44:35,287 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2609 transitions. Word has length 158 [2023-11-29 03:44:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:35,287 INFO L495 AbstractCegarLoop]: Abstraction has 1839 states and 2609 transitions. [2023-11-29 03:44:35,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2609 transitions. [2023-11-29 03:44:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 03:44:35,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:35,289 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:35,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 03:44:35,289 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:35,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1758480163, now seen corresponding path program 1 times [2023-11-29 03:44:35,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683512546] [2023-11-29 03:44:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:44:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:44:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:44:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:44:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:44:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:44:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:44:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:44:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:44:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:44:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:44:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:44:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:44:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:44:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:44:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:44:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:44:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:44:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:44:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:44:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:44:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:44:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:44:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683512546] [2023-11-29 03:44:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683512546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:44:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047432518] [2023-11-29 03:44:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:35,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:44:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:44:35,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:44:35,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:44:35,714 INFO L87 Difference]: Start difference. First operand 1839 states and 2609 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:37,149 INFO L93 Difference]: Finished difference Result 3859 states and 5472 transitions. [2023-11-29 03:44:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:44:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2023-11-29 03:44:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:37,153 INFO L225 Difference]: With dead ends: 3859 [2023-11-29 03:44:37,153 INFO L226 Difference]: Without dead ends: 2067 [2023-11-29 03:44:37,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 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 03:44:37,155 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 283 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:37,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 574 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:44:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2023-11-29 03:44:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1881. [2023-11-29 03:44:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1671 states have (on average 1.3614602034709755) internal successors, (2275), 1677 states have internal predecessors, (2275), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2023-11-29 03:44:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2659 transitions. [2023-11-29 03:44:37,600 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2659 transitions. Word has length 158 [2023-11-29 03:44:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:37,601 INFO L495 AbstractCegarLoop]: Abstraction has 1881 states and 2659 transitions. [2023-11-29 03:44:37,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:44:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2659 transitions. [2023-11-29 03:44:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 03:44:37,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:37,602 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:37,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 03:44:37,602 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:37,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash -437226773, now seen corresponding path program 1 times [2023-11-29 03:44:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:44:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882967655] [2023-11-29 03:44:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:44:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:44:37,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:44:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:44:37,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:44:37,773 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:44:37,774 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:44:37,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 03:44:37,778 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:37,782 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:44:37,885 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:44:37,886 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:44:37,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 03:44:37,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 03:44:37,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 03:44:37,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 03:44:37,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 03:44:37,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 03:44:37,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-29 03:44:37,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 03:44:37,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 03:44:37,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-29 03:44:37,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 03:44:37,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 03:44:37,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:44:37 BoogieIcfgContainer [2023-11-29 03:44:37,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:44:37,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:44:37,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:44:37,918 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:44:37,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:43:55" (3/4) ... [2023-11-29 03:44:37,920 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:44:37,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:44:37,922 INFO L158 Benchmark]: Toolchain (without parser) took 43691.09ms. Allocated memory was 159.4MB in the beginning and 616.6MB in the end (delta: 457.2MB). Free memory was 117.5MB in the beginning and 564.2MB in the end (delta: -446.8MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,922 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:44:37,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.70ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 101.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.92ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 96.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,923 INFO L158 Benchmark]: Boogie Preprocessor took 84.95ms. Allocated memory is still 159.4MB. Free memory was 96.5MB in the beginning and 90.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,923 INFO L158 Benchmark]: RCFGBuilder took 659.38ms. Allocated memory is still 159.4MB. Free memory was 90.2MB in the beginning and 101.9MB in the end (delta: -11.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,923 INFO L158 Benchmark]: TraceAbstraction took 42439.69ms. Allocated memory was 159.4MB in the beginning and 616.6MB in the end (delta: 457.2MB). Free memory was 101.1MB in the beginning and 564.2MB in the end (delta: -463.2MB). Peak memory consumption was 343.0MB. Max. memory is 16.1GB. [2023-11-29 03:44:37,924 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 616.6MB. Free memory is still 564.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:44:37,926 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.28ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.70ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 101.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.92ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 96.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.95ms. Allocated memory is still 159.4MB. Free memory was 96.5MB in the beginning and 90.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 659.38ms. Allocated memory is still 159.4MB. Free memory was 90.2MB in the beginning and 101.9MB in the end (delta: -11.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42439.69ms. Allocated memory was 159.4MB in the beginning and 616.6MB in the end (delta: 457.2MB). Free memory was 101.1MB in the beginning and 564.2MB in the end (delta: -463.2MB). Peak memory consumption was 343.0MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 616.6MB. Free memory is still 564.2MB. 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~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182. 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] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] 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_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_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_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_53=256, var_1_54=5/4, var_1_55=5] [L141] 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_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_53=256, var_1_54=5/4, var_1_55=5] [L142] 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_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_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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] 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_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_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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] 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=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_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_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=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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] 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=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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] 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=64, 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_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_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=64, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] 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=64, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] 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=64, var_1_16=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_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_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=64, var_1_16=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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] 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=64, var_1_16=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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] 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=64, var_1_16=0, 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_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_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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] 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=64, var_1_16=0, 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_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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, 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_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, 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_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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 [L65] var_1_55 = var_1_32 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=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L66] COND FALSE !(\read(var_1_7)) [L69] 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=64, var_1_16=0, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L71] 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=64, var_1_16=0, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L74] COND FALSE !(var_1_21 > (var_1_21 + var_1_23)) 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=64, var_1_16=0, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L81] var_1_48 = var_1_15 [L82] var_1_32 = var_1_16 [L83] var_1_54 = var_1_18 [L84] var_1_30 = var_1_32 [L85] 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=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L86] 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=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L86] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L87] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L89] COND TRUE (-32 & var_1_15) > var_1_11 [L90] var_1_40 = ((((var_1_21) > (var_1_19)) ? (var_1_21) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L94] COND FALSE !(var_1_19 >= ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L101] COND TRUE var_1_19 <= (var_1_19 + var_1_18) [L102] var_1_45 = 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L105] COND TRUE var_1_21 < var_1_22 [L106] var_1_49 = ((var_1_50 - var_1_51) + 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L110] COND TRUE var_1_11 >= var_1_30 [L111] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L113] var_1_53 = var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L114] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L114] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L115] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L123] 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=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L124] COND TRUE ! var_1_7 [L125] 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=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] EXPR var_1_30 ^ 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=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] EXPR var_1_13 | 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=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] COND TRUE (var_1_30 ^ var_1_32) < (var_1_13 | var_1_11) [L134] var_1_33 = ((((var_1_15) > (var_1_15)) ? (var_1_15) : (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=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182-L183] 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)) ; [L192] RET, EXPR property() [L192] 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, 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=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=64, var_1_49=-63, var_1_50=63, var_1_51=63, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 28, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5915 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5915 mSDsluCounter, 14398 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9559 mSDsCounter, 1196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7503 IncrementalHoareTripleChecker+Invalid, 8699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1196 mSolverCounterUnsat, 4839 mSDtfsCounter, 7503 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1502 GetRequests, 1318 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1881occurred in iteration=27, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 7013 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 4378 NumberOfCodeBlocks, 4378 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4192 ConstructedInterpolants, 0 QuantifiedInterpolants, 18539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 24948/24948 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:44:37,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:44:40,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:44:40,145 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:44:40,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:44:40,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:44:40,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:44:40,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:44:40,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:44:40,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:44:40,199 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:44:40,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:44:40,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:44:40,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:44:40,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:44:40,203 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:44:40,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:44:40,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:44:40,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:44:40,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:44:40,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:44:40,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:44:40,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:44:40,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:44:40,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:44:40,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:44:40,210 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:44:40,210 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:44:40,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:44:40,211 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:44:40,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:44:40,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:44:40,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:44:40,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:44:40,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:44:40,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:44:40,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:44:40,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:44:40,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:44:40,215 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:44:40,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:44:40,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:44:40,216 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:44:40,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:44:40,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:44:40,216 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:44:40,217 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2023-11-29 03:44:40,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:44:40,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:44:40,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:44:40,596 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:44:40,596 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:44:40,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:44:43,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:44:43,776 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:44:43,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:44:43,789 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/637a9b5d5/48fa752a0d334aa2943d4b2ddcf236df/FLAG337d13756 [2023-11-29 03:44:43,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/data/637a9b5d5/48fa752a0d334aa2943d4b2ddcf236df [2023-11-29 03:44:43,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:44:43,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:44:43,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:44:43,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:44:43,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:44:43,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:44:43" (1/1) ... [2023-11-29 03:44:43,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bab7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:43, skipping insertion in model container [2023-11-29 03:44:43,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:44:43" (1/1) ... [2023-11-29 03:44:43,865 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:44:44,042 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2023-11-29 03:44:44,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:44:44,145 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:44:44,161 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_e9babc99-2ce4-4dda-b93e-94ca909a1bca/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2023-11-29 03:44:44,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:44:44,226 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:44:44,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44 WrapperNode [2023-11-29 03:44:44,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:44:44,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:44:44,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:44:44,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:44:44,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,291 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2023-11-29 03:44:44,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:44:44,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:44:44,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:44:44,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:44:44,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,343 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 03:44:44,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:44:44,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:44:44,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:44:44,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:44:44,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (1/1) ... [2023-11-29 03:44:44,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:44:44,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:44:44,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:44:44,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:44:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:44:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:44:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:44:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:44:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:44:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:44:44,587 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:44:44,589 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:44:51,841 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:44:51,906 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:44:51,907 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:44:51,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:44:51 BoogieIcfgContainer [2023-11-29 03:44:51,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:44:51,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:44:51,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:44:51,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:44:51,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:44:43" (1/3) ... [2023-11-29 03:44:51,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4061b699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:44:51, skipping insertion in model container [2023-11-29 03:44:51,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:44:44" (2/3) ... [2023-11-29 03:44:51,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4061b699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:44:51, skipping insertion in model container [2023-11-29 03:44:51,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:44:51" (3/3) ... [2023-11-29 03:44:51,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2023-11-29 03:44:51,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:44:51,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:44:51,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:44:51,989 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;@382f3127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:44:51,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:44:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:44:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 03:44:52,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:52,013 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:52,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:52,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1771965971, now seen corresponding path program 1 times [2023-11-29 03:44:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:44:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846003692] [2023-11-29 03:44:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:52,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:44:52,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:44:52,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:44:52,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:44:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:52,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:44:52,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:44:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-11-29 03:44:52,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:44:52,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:44:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846003692] [2023-11-29 03:44:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846003692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:44:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139224760] [2023-11-29 03:44:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:52,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:44:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:44:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:44:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:44:52,800 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:44:55,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:44:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:44:55,506 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2023-11-29 03:44:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:44:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2023-11-29 03:44:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:44:55,549 INFO L225 Difference]: With dead ends: 139 [2023-11-29 03:44:55,549 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 03:44:55,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:44:55,556 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:44:55,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 03:44:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 03:44:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-29 03:44:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:44:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2023-11-29 03:44:55,604 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 146 [2023-11-29 03:44:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:44:55,605 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2023-11-29 03:44:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 03:44:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2023-11-29 03:44:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 03:44:55,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:44:55,611 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:44:55,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:44:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:44:55,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:44:55,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:44:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -212665697, now seen corresponding path program 1 times [2023-11-29 03:44:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:44:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878267110] [2023-11-29 03:44:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:44:55,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:44:55,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:44:55,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:44:55,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:44:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:44:56,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:44:56,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:44:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:44:58,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:44:58,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:44:58,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878267110] [2023-11-29 03:44:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878267110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:44:58,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:44:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:44:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853780168] [2023-11-29 03:44:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:44:58,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:44:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:44:58,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:44:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:44:58,068 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:03,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:05,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:08,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:45:08,139 INFO L93 Difference]: Finished difference Result 206 states and 323 transitions. [2023-11-29 03:45:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:45:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 03:45:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:45:08,178 INFO L225 Difference]: With dead ends: 206 [2023-11-29 03:45:08,178 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 03:45:08,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 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 03:45:08,181 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:45:08,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 354 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 03:45:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 03:45:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2023-11-29 03:45:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 03:45:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2023-11-29 03:45:08,216 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 146 [2023-11-29 03:45:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:45:08,217 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2023-11-29 03:45:08,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2023-11-29 03:45:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 03:45:08,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:45:08,222 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:45:08,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:45:08,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:08,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:45:08,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:45:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1030314147, now seen corresponding path program 1 times [2023-11-29 03:45:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:45:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320896558] [2023-11-29 03:45:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:45:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:45:08,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:45:08,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:45:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:45:08,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:45:08,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:45:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:45:08,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:45:08,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:45:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320896558] [2023-11-29 03:45:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320896558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:45:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:45:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:45:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571053128] [2023-11-29 03:45:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:45:08,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:45:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:45:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:45:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:45:08,986 INFO L87 Difference]: Start difference. First operand 111 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:12,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:16,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:45:16,584 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2023-11-29 03:45:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:45:16,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 03:45:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:45:16,618 INFO L225 Difference]: With dead ends: 203 [2023-11-29 03:45:16,619 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 03:45:16,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:45:16,621 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:45:16,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 197 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-29 03:45:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 03:45:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2023-11-29 03:45:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 03:45:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2023-11-29 03:45:16,648 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 146 [2023-11-29 03:45:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:45:16,649 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2023-11-29 03:45:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2023-11-29 03:45:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 03:45:16,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:45:16,653 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:45:16,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:45:16,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:16,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:45:16,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:45:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1676305247, now seen corresponding path program 1 times [2023-11-29 03:45:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:45:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462680975] [2023-11-29 03:45:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:45:16,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:45:16,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:45:16,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:45:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:45:17,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:45:17,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:45:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 03:45:18,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:45:18,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:45:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462680975] [2023-11-29 03:45:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462680975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:45:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:45:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:45:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228948557] [2023-11-29 03:45:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:45:18,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:45:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:45:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:45:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:45:18,072 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:22,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:25,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:45:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:45:25,917 INFO L93 Difference]: Finished difference Result 391 states and 616 transitions. [2023-11-29 03:45:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:45:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 03:45:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:45:25,926 INFO L225 Difference]: With dead ends: 391 [2023-11-29 03:45:25,926 INFO L226 Difference]: Without dead ends: 306 [2023-11-29 03:45:25,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:45:25,929 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 248 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:45:25,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 329 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-29 03:45:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-29 03:45:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 225. [2023-11-29 03:45:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-29 03:45:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2023-11-29 03:45:25,973 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 146 [2023-11-29 03:45:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:45:25,974 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2023-11-29 03:45:25,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 03:45:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2023-11-29 03:45:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 03:45:25,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:45:25,978 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:45:25,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:45:26,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:26,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:45:26,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:45:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1676245665, now seen corresponding path program 1 times [2023-11-29 03:45:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:45:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679442332] [2023-11-29 03:45:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:45:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:45:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:45:26,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:45:26,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9babc99-2ce4-4dda-b93e-94ca909a1bca/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:45:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:45:26,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:45:26,683 INFO L285 TraceCheckSpWp]: Computing forward predicates...