./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:43:12,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:43:12,523 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:43:12,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:43:12,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:43:12,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:43:12,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:43:12,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:43:12,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:43:12,552 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:43:12,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:43:12,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:43:12,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:43:12,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:43:12,555 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:43:12,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:43:12,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:43:12,556 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:43:12,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:43:12,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:43:12,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:43:12,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:43:12,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:43:12,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:43:12,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:43:12,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:43:12,560 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:43:12,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:43:12,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:43:12,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:43:12,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:43:12,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:12,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:43:12,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:43:12,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:43:12,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:43:12,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:43:12,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:43:12,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:43:12,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:43:12,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:43:12,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:43:12,564 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_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2023-11-29 04:43:12,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:43:12,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:43:12,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:43:12,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:43:12,852 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:43:12,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:15,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:43:15,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:43:15,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:15,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/dc8fe0c25/e782403e47f344e9b6ee4db138a18c8e/FLAGb59192d15 [2023-11-29 04:43:15,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/dc8fe0c25/e782403e47f344e9b6ee4db138a18c8e [2023-11-29 04:43:15,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:43:15,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:43:15,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:15,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:43:15,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:43:15,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:15" (1/1) ... [2023-11-29 04:43:15,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630a6122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:15, skipping insertion in model container [2023-11-29 04:43:15,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:15" (1/1) ... [2023-11-29 04:43:15,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:43:16,046 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_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-11-29 04:43:16,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:16,119 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:43:16,129 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_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-11-29 04:43:16,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:16,177 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:43:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16 WrapperNode [2023-11-29 04:43:16,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:16,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:16,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:43:16,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:43:16,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,236 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-29 04:43:16,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:16,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:43:16,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:43:16,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:43:16,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,267 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:43:16,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:43:16,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:43:16,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:43:16,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:43:16,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (1/1) ... [2023-11-29 04:43:16,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:43:16,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:43:16,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:43:16,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:43:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:43:16,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:43:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:43:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:43:16,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:43:16,458 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:43:16,460 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:43:16,782 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:43:16,822 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:43:16,822 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:43:16,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:16 BoogieIcfgContainer [2023-11-29 04:43:16,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:43:16,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:43:16,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:43:16,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:43:16,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:43:15" (1/3) ... [2023-11-29 04:43:16,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5903c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:16, skipping insertion in model container [2023-11-29 04:43:16,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:16" (2/3) ... [2023-11-29 04:43:16,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5903c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:16, skipping insertion in model container [2023-11-29 04:43:16,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:16" (3/3) ... [2023-11-29 04:43:16,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:16,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:43:16,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:43:16,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:43:16,914 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;@2b13d41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:43:16,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:43:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:16,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:16,930 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:16,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:16,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1333531042, now seen corresponding path program 1 times [2023-11-29 04:43:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457964040] [2023-11-29 04:43:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457964040] [2023-11-29 04:43:17,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457964040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:17,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:43:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896477463] [2023-11-29 04:43:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:17,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:43:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:17,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:43:17,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:43:17,372 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:17,413 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2023-11-29 04:43:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:43:17,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2023-11-29 04:43:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:17,423 INFO L225 Difference]: With dead ends: 121 [2023-11-29 04:43:17,423 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 04:43:17,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 04:43:17,430 INFO L413 NwaCegarLoop]: 88 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, 88 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 04:43:17,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 04:43:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 04:43:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-11-29 04:43:17,471 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 112 [2023-11-29 04:43:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:17,472 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-11-29 04:43:17,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-11-29 04:43:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:17,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:17,476 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:17,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:43:17,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:17,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 646606634, now seen corresponding path program 1 times [2023-11-29 04:43:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566918890] [2023-11-29 04:43:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566918890] [2023-11-29 04:43:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566918890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928914749] [2023-11-29 04:43:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:17,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:17,728 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:17,785 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2023-11-29 04:43:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:17,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-29 04:43:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:17,788 INFO L225 Difference]: With dead ends: 143 [2023-11-29 04:43:17,789 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 04:43:17,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 04:43:17,791 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:17,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 04:43:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-11-29 04:43:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2023-11-29 04:43:17,806 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 112 [2023-11-29 04:43:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:17,808 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2023-11-29 04:43:17,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2023-11-29 04:43:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:17,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:17,811 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:17,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:43:17,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:17,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1962809622, now seen corresponding path program 1 times [2023-11-29 04:43:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338810525] [2023-11-29 04:43:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338810525] [2023-11-29 04:43:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338810525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:18,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:18,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:43:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926376541] [2023-11-29 04:43:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:43:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:18,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:43:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:43:18,196 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:18,404 INFO L93 Difference]: Finished difference Result 209 states and 318 transitions. [2023-11-29 04:43:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:43:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-29 04:43:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:18,408 INFO L225 Difference]: With dead ends: 209 [2023-11-29 04:43:18,408 INFO L226 Difference]: Without dead ends: 139 [2023-11-29 04:43:18,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 04:43:18,411 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 200 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:18,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 161 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:43:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-29 04:43:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2023-11-29 04:43:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2023-11-29 04:43:18,435 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 112 [2023-11-29 04:43:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:18,436 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2023-11-29 04:43:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2023-11-29 04:43:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:18,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:18,440 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:18,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:43:18,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:18,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2073992236, now seen corresponding path program 1 times [2023-11-29 04:43:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78718901] [2023-11-29 04:43:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78718901] [2023-11-29 04:43:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78718901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:43:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154047339] [2023-11-29 04:43:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:18,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:43:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:43:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:43:18,970 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:19,262 INFO L93 Difference]: Finished difference Result 270 states and 404 transitions. [2023-11-29 04:43:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:43:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-29 04:43:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:19,266 INFO L225 Difference]: With dead ends: 270 [2023-11-29 04:43:19,267 INFO L226 Difference]: Without dead ends: 180 [2023-11-29 04:43:19,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 04:43:19,269 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 208 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:19,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 315 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:43:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-29 04:43:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 102. [2023-11-29 04:43:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2023-11-29 04:43:19,299 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 112 [2023-11-29 04:43:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:19,300 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2023-11-29 04:43:19,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2023-11-29 04:43:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:19,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:19,303 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:19,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:43:19,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:19,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1321040424, now seen corresponding path program 1 times [2023-11-29 04:43:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:19,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912693708] [2023-11-29 04:43:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912693708] [2023-11-29 04:43:19,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912693708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:19,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:19,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:43:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149718717] [2023-11-29 04:43:19,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:43:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:43:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:43:19,652 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:19,990 INFO L93 Difference]: Finished difference Result 298 states and 442 transitions. [2023-11-29 04:43:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:43:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-29 04:43:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:19,993 INFO L225 Difference]: With dead ends: 298 [2023-11-29 04:43:19,993 INFO L226 Difference]: Without dead ends: 197 [2023-11-29 04:43:19,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 04:43:19,995 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 192 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:19,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 95 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:43:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-29 04:43:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2023-11-29 04:43:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2023-11-29 04:43:20,023 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 112 [2023-11-29 04:43:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:20,024 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2023-11-29 04:43:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2023-11-29 04:43:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:43:20,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:20,026 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:20,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:43:20,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:20,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1062874986, now seen corresponding path program 1 times [2023-11-29 04:43:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549325877] [2023-11-29 04:43:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549325877] [2023-11-29 04:43:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549325877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:43:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008509134] [2023-11-29 04:43:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:20,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:43:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:43:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:43:20,502 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:20,902 INFO L93 Difference]: Finished difference Result 270 states and 398 transitions. [2023-11-29 04:43:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:43:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-29 04:43:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:20,904 INFO L225 Difference]: With dead ends: 270 [2023-11-29 04:43:20,904 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 04:43:20,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:43:20,906 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 86 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:20,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 640 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:43:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 04:43:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-11-29 04:43:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2023-11-29 04:43:20,934 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 112 [2023-11-29 04:43:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:20,935 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2023-11-29 04:43:20,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2023-11-29 04:43:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:43:20,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:20,937 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:20,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:43:20,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:20,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash -234745676, now seen corresponding path program 1 times [2023-11-29 04:43:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146043556] [2023-11-29 04:43:20,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146043556] [2023-11-29 04:43:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146043556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:43:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820272359] [2023-11-29 04:43:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:21,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:43:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:43:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:43:21,268 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:21,649 INFO L93 Difference]: Finished difference Result 377 states and 556 transitions. [2023-11-29 04:43:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:43:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 04:43:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:21,654 INFO L225 Difference]: With dead ends: 377 [2023-11-29 04:43:21,654 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 04:43:21,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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 04:43:21,656 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 298 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:43:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 04:43:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-11-29 04:43:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 190 states have internal predecessors, (264), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2023-11-29 04:43:21,702 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 113 [2023-11-29 04:43:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:21,702 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2023-11-29 04:43:21,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2023-11-29 04:43:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:43:21,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:21,705 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:21,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:43:21,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:21,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 294085926, now seen corresponding path program 1 times [2023-11-29 04:43:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230226503] [2023-11-29 04:43:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230226503] [2023-11-29 04:43:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230226503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:21,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707681200] [2023-11-29 04:43:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:21,812 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:21,947 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2023-11-29 04:43:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 04:43:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:21,951 INFO L225 Difference]: With dead ends: 540 [2023-11-29 04:43:21,951 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 04:43:21,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 04:43:21,953 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:21,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 04:43:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 232. [2023-11-29 04:43:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.380710659898477) internal successors, (272), 197 states have internal predecessors, (272), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 336 transitions. [2023-11-29 04:43:22,015 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 336 transitions. Word has length 113 [2023-11-29 04:43:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:22,016 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 336 transitions. [2023-11-29 04:43:22,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 336 transitions. [2023-11-29 04:43:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:43:22,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:22,018 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:22,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:43:22,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:22,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1798271025, now seen corresponding path program 1 times [2023-11-29 04:43:22,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125727811] [2023-11-29 04:43:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125727811] [2023-11-29 04:43:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125727811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822516692] [2023-11-29 04:43:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:22,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:22,125 INFO L87 Difference]: Start difference. First operand 232 states and 336 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:22,257 INFO L93 Difference]: Finished difference Result 545 states and 789 transitions. [2023-11-29 04:43:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 04:43:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:22,261 INFO L225 Difference]: With dead ends: 545 [2023-11-29 04:43:22,261 INFO L226 Difference]: Without dead ends: 314 [2023-11-29 04:43:22,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 04:43:22,262 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:22,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 175 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-29 04:43:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2023-11-29 04:43:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 177 states have internal predecessors, (241), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2023-11-29 04:43:22,321 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 113 [2023-11-29 04:43:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:22,321 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2023-11-29 04:43:22,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2023-11-29 04:43:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:43:22,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:22,323 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:22,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:43:22,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:22,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 582902774, now seen corresponding path program 1 times [2023-11-29 04:43:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811929680] [2023-11-29 04:43:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811929680] [2023-11-29 04:43:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811929680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:22,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:43:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887944452] [2023-11-29 04:43:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:22,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:43:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:22,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:43:22,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:43:22,813 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:23,368 INFO L93 Difference]: Finished difference Result 501 states and 704 transitions. [2023-11-29 04:43:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:43:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 04:43:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:23,372 INFO L225 Difference]: With dead ends: 501 [2023-11-29 04:43:23,372 INFO L226 Difference]: Without dead ends: 290 [2023-11-29 04:43:23,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:43:23,373 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:23,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 489 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:43:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-29 04:43:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 210. [2023-11-29 04:43:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 175 states have internal predecessors, (226), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 290 transitions. [2023-11-29 04:43:23,425 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 290 transitions. Word has length 113 [2023-11-29 04:43:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:23,426 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 290 transitions. [2023-11-29 04:43:23,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 290 transitions. [2023-11-29 04:43:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:43:23,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:23,428 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:23,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:43:23,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:23,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1538284443, now seen corresponding path program 1 times [2023-11-29 04:43:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2593990] [2023-11-29 04:43:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2593990] [2023-11-29 04:43:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2593990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:23,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:43:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788225494] [2023-11-29 04:43:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:43:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:43:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:43:23,858 INFO L87 Difference]: Start difference. First operand 210 states and 290 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:24,672 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2023-11-29 04:43:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:43:24,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-29 04:43:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:24,674 INFO L225 Difference]: With dead ends: 518 [2023-11-29 04:43:24,675 INFO L226 Difference]: Without dead ends: 309 [2023-11-29 04:43:24,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:43:24,676 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 185 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:24,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 602 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:43:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-29 04:43:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 218. [2023-11-29 04:43:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 183 states have (on average 1.289617486338798) internal successors, (236), 183 states have internal predecessors, (236), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 300 transitions. [2023-11-29 04:43:24,721 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 300 transitions. Word has length 114 [2023-11-29 04:43:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:24,722 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 300 transitions. [2023-11-29 04:43:24,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 300 transitions. [2023-11-29 04:43:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:43:24,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:24,723 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:43:24,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:24,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1105564529, now seen corresponding path program 1 times [2023-11-29 04:43:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926350286] [2023-11-29 04:43:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 04:43:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 04:43:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:43:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:43:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:43:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:43:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:43:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 04:43:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 04:43:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926350286] [2023-11-29 04:43:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926350286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:24,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281948040] [2023-11-29 04:43:24,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:24,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:24,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:24,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:24,804 INFO L87 Difference]: Start difference. First operand 218 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:24,913 INFO L93 Difference]: Finished difference Result 551 states and 757 transitions. [2023-11-29 04:43:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-29 04:43:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:24,916 INFO L225 Difference]: With dead ends: 551 [2023-11-29 04:43:24,916 INFO L226 Difference]: Without dead ends: 334 [2023-11-29 04:43:24,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 04:43:24,917 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:24,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 160 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-29 04:43:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2023-11-29 04:43:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 211 states have internal predecessors, (269), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:43:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2023-11-29 04:43:24,969 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 114 [2023-11-29 04:43:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:24,970 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2023-11-29 04:43:24,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2023-11-29 04:43:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:43:24,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:24,972 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:24,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:43:24,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:24,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1103717487, now seen corresponding path program 1 times [2023-11-29 04:43:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249163962] [2023-11-29 04:43:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:43:25,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:43:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:43:25,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:43:25,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:43:25,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:43:25,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:43:25,116 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:25,119 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:43:25,187 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:43:25,189 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 04:43:25,190 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-29 04:43:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 04:43:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-29 04:43:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-29 04:43:25,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 04:43:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-29 04:43:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 04:43:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-29 04:43:25,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-29 04:43:25,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:43:25 BoogieIcfgContainer [2023-11-29 04:43:25,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:43:25,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:43:25,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:43:25,211 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:43:25,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:16" (3/4) ... [2023-11-29 04:43:25,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:43:25,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:43:25,215 INFO L158 Benchmark]: Toolchain (without parser) took 9328.81ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 129.3MB in the beginning and 150.9MB in the end (delta: -21.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-11-29 04:43:25,215 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:43:25,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.11ms. Allocated memory is still 165.7MB. Free memory was 128.7MB in the beginning and 114.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:43:25,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 111.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:43:25,216 INFO L158 Benchmark]: Boogie Preprocessor took 54.57ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 106.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:43:25,216 INFO L158 Benchmark]: RCFGBuilder took 530.09ms. Allocated memory is still 165.7MB. Free memory was 105.5MB in the beginning and 81.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:43:25,217 INFO L158 Benchmark]: TraceAbstraction took 8384.92ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 81.1MB in the beginning and 151.9MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:43:25,217 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 226.5MB. Free memory was 151.9MB in the beginning and 150.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:43:25,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.11ms. Allocated memory is still 165.7MB. Free memory was 128.7MB in the beginning and 114.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 111.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.57ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 106.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 530.09ms. Allocated memory is still 165.7MB. Free memory was 105.5MB in the beginning and 81.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8384.92ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 81.1MB in the beginning and 151.9MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 226.5MB. Free memory was 151.9MB in the beginning and 150.9MB in the end (delta: 1.0MB). 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~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 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 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. 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] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] 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] [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] [L92] 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] [L93] 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_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_7=0] [L93] 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_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] 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_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_7=0] [L95] 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_7=0] [L96] 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=254, 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_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=254, 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_7=0] [L96] 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=254, 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_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] 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=254, 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_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=254, 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_7=0] [L98] 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=254, 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_7=0] [L99] 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=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] 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=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] 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=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] 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=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] 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=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] 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=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, 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_7=0] [L58] 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=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, 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_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] 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=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] 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=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] 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)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 3406 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2035 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1371 mSDtfsCounter, 1300 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 765 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5760/5760 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 04:43:25,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:43:27,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:43:27,321 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:43:27,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:43:27,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:43:27,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:43:27,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:43:27,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:43:27,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:43:27,360 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:43:27,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:43:27,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:43:27,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:43:27,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:43:27,363 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:43:27,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:43:27,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:43:27,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:43:27,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:43:27,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:43:27,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:43:27,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:43:27,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:43:27,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:43:27,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:43:27,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:43:27,369 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:43:27,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:43:27,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:43:27,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:43:27,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:43:27,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:43:27,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:43:27,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:27,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:43:27,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:43:27,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:43:27,373 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:43:27,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:43:27,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:43:27,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:43:27,374 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:43:27,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:43:27,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:43:27,374 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:43:27,375 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_f67a2559-c846-464b-be7f-303a5b153a14/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_f67a2559-c846-464b-be7f-303a5b153a14/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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2023-11-29 04:43:27,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:43:27,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:43:27,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:43:27,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:43:27,694 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:43:27,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:30,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:43:30,726 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:43:30,727 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:30,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/66dd5babc/a760006b83f74553a3492b0dc0b146aa/FLAGf0cda41a5 [2023-11-29 04:43:30,751 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/data/66dd5babc/a760006b83f74553a3492b0dc0b146aa [2023-11-29 04:43:30,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:43:30,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:43:30,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:30,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:43:30,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:43:30,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:30" (1/1) ... [2023-11-29 04:43:30,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff06b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:30, skipping insertion in model container [2023-11-29 04:43:30,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:30" (1/1) ... [2023-11-29 04:43:30,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:43:30,920 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_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-11-29 04:43:30,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:30,996 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:43:31,007 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_f67a2559-c846-464b-be7f-303a5b153a14/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-11-29 04:43:31,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:31,096 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:43:31,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31 WrapperNode [2023-11-29 04:43:31,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:31,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:31,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:43:31,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:43:31,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,157 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2023-11-29 04:43:31,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:31,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:43:31,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:43:31,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:43:31,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:43:31,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:43:31,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:43:31,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:43:31,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:43:31,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (1/1) ... [2023-11-29 04:43:31,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:43:31,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:43:31,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:43:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:43:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:43:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:43:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:43:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:43:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:43:31,398 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:43:31,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:43:36,153 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:43:36,199 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:43:36,200 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:43:36,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:36 BoogieIcfgContainer [2023-11-29 04:43:36,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:43:36,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:43:36,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:43:36,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:43:36,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:43:30" (1/3) ... [2023-11-29 04:43:36,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:36, skipping insertion in model container [2023-11-29 04:43:36,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:31" (2/3) ... [2023-11-29 04:43:36,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:36, skipping insertion in model container [2023-11-29 04:43:36,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:36" (3/3) ... [2023-11-29 04:43:36,208 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2023-11-29 04:43:36,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:43:36,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:43:36,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:43:36,287 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;@3aa84bf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:43:36,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:43:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 04:43:36,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:36,304 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:36,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:36,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1106764813, now seen corresponding path program 1 times [2023-11-29 04:43:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:43:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437060044] [2023-11-29 04:43:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:36,325 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 04:43:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:43:36,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:36,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:36,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:43:36,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:43:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-11-29 04:43:36,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:43:36,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:43:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437060044] [2023-11-29 04:43:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437060044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:36,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:36,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:43:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172008979] [2023-11-29 04:43:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:36,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:43:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:43:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:43:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:43:36,833 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:40,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:43:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:40,947 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2023-11-29 04:43:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:43:40,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2023-11-29 04:43:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:40,986 INFO L225 Difference]: With dead ends: 101 [2023-11-29 04:43:40,986 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 04:43:40,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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 04:43:40,993 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:40,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 04:43:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 04:43:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 04:43:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2023-11-29 04:43:41,033 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 106 [2023-11-29 04:43:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:41,034 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2023-11-29 04:43:41,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2023-11-29 04:43:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 04:43:41,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:41,037 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:41,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:41,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:41,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1542581721, now seen corresponding path program 1 times [2023-11-29 04:43:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:43:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251460225] [2023-11-29 04:43:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:41,239 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 04:43:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:43:41,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:41,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:41,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:43:41,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:43:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:41,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:43:41,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:43:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251460225] [2023-11-29 04:43:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251460225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:41,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039776654] [2023-11-29 04:43:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:41,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:43:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:41,713 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:44,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:43:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:44,792 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2023-11-29 04:43:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2023-11-29 04:43:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:44,796 INFO L225 Difference]: With dead ends: 113 [2023-11-29 04:43:44,796 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 04:43:44,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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 04:43:44,799 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:44,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 04:43:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 04:43:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-11-29 04:43:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2023-11-29 04:43:44,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 106 [2023-11-29 04:43:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:44,816 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2023-11-29 04:43:44,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:43:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2023-11-29 04:43:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 04:43:44,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:44,820 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:44,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:43:45,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:45,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:45,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1850619289, now seen corresponding path program 1 times [2023-11-29 04:43:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:43:45,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836634215] [2023-11-29 04:43:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:45,027 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 04:43:45,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:43:45,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:45,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f67a2559-c846-464b-be7f-303a5b153a14/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 04:43:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:45,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 04:43:45,528 INFO L285 TraceCheckSpWp]: Computing forward predicates...