./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/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 cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:02:41,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:02:41,983 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:02:41,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:02:41,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:02:42,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:02:42,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:02:42,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:02:42,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:02:42,023 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:02:42,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:02:42,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:02:42,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:02:42,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:02:42,026 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:02:42,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:02:42,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:02:42,028 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:02:42,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:02:42,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:02:42,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:02:42,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:02:42,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:02:42,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:02:42,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:02:42,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:02:42,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:02:42,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:02:42,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:02:42,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:02:42,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:02:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:02:42,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:02:42,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:02:42,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:02:42,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:02:42,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:02:42,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:02:42,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:02:42,037 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:02:42,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:02:42,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:02:42,037 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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/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 -> cad39411d7becf64b0716e48fab4680fd039796e30818af24b0de5905de7c645 [2023-11-29 02:02:42,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:02:42,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:02:42,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:02:42,343 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:02:42,343 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:02:42,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-29 02:02:45,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:02:45,946 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:02:45,947 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-29 02:02:45,958 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/data/412f98013/c5e76251a7ea4e3499488bfe260de02d/FLAGf4311b9ff [2023-11-29 02:02:45,975 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/data/412f98013/c5e76251a7ea4e3499488bfe260de02d [2023-11-29 02:02:45,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:02:45,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:02:45,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:02:45,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:02:45,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:02:45,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:02:45" (1/1) ... [2023-11-29 02:02:45,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bdb87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:45, skipping insertion in model container [2023-11-29 02:02:45,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:02:45" (1/1) ... [2023-11-29 02:02:46,029 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:02:46,205 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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-29 02:02:46,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:02:46,271 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:02:46,288 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_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i[915,928] [2023-11-29 02:02:46,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:02:46,336 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:02:46,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46 WrapperNode [2023-11-29 02:02:46,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:02:46,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:02:46,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:02:46,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:02:46,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,400 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-29 02:02:46,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:02:46,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:02:46,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:02:46,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:02:46,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,441 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 02:02:46,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:02:46,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:02:46,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:02:46,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:02:46,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (1/1) ... [2023-11-29 02:02:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:02:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:02:46,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:02:46,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:02:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:02:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:02:46,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:02:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:02:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:02:46,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:02:46,643 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:02:46,645 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:02:46,919 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:02:46,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:02:46,987 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:02:46,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:46 BoogieIcfgContainer [2023-11-29 02:02:46,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:02:46,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:02:46,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:02:46,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:02:46,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:02:45" (1/3) ... [2023-11-29 02:02:46,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:02:46, skipping insertion in model container [2023-11-29 02:02:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:02:46" (2/3) ... [2023-11-29 02:02:46,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:02:46, skipping insertion in model container [2023-11-29 02:02:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:46" (3/3) ... [2023-11-29 02:02:46,999 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-11-29 02:02:47,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:02:47,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:02:47,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:02:47,079 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;@7c97c021, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:02:47,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:02:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 02:02:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 02:02:47,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:02:47,095 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:47,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:02:47,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1223872176, now seen corresponding path program 1 times [2023-11-29 02:02:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:47,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730045129] [2023-11-29 02:02:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:02:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:02:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:02:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:02:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:02:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:02:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:02:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:02:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:02:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:02:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:02:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:02:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:02:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 02:02:48,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730045129] [2023-11-29 02:02:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730045129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:02:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560633972] [2023-11-29 02:02:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:02:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:02:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:02:48,505 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:02:48,920 INFO L93 Difference]: Finished difference Result 152 states and 267 transitions. [2023-11-29 02:02:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:02:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2023-11-29 02:02:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:02:48,936 INFO L225 Difference]: With dead ends: 152 [2023-11-29 02:02:48,936 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 02:02:48,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:02:48,945 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:02:48,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 159 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:02:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 02:02:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2023-11-29 02:02:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 02:02:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-11-29 02:02:49,038 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2023-11-29 02:02:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:02:49,040 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-11-29 02:02:49,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-11-29 02:02:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 02:02:49,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:02:49,045 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:49,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:02:49,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:02:49,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 310777802, now seen corresponding path program 1 times [2023-11-29 02:02:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846312840] [2023-11-29 02:02:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:02:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:02:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:02:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:02:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:02:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:02:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:02:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:02:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:02:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:02:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:02:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:02:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:02:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 02:02:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846312840] [2023-11-29 02:02:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846312840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:02:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884725305] [2023-11-29 02:02:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:49,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:02:49,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:02:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:02:49,328 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:02:49,485 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2023-11-29 02:02:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:02:49,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-11-29 02:02:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:02:49,489 INFO L225 Difference]: With dead ends: 192 [2023-11-29 02:02:49,489 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 02:02:49,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 02:02:49,493 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:02:49,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 155 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:02:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 02:02:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-11-29 02:02:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-29 02:02:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2023-11-29 02:02:49,548 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 84 [2023-11-29 02:02:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:02:49,549 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2023-11-29 02:02:49,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2023-11-29 02:02:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 02:02:49,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:02:49,552 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:49,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:02:49,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:02:49,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 570179731, now seen corresponding path program 1 times [2023-11-29 02:02:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142951933] [2023-11-29 02:02:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:02:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:02:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:02:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:02:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:02:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:02:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:02:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:02:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:02:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:02:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:02:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:02:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:02:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 02:02:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142951933] [2023-11-29 02:02:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142951933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:02:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278801546] [2023-11-29 02:02:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:51,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:02:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:02:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:02:51,164 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:02:51,669 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2023-11-29 02:02:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:02:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-11-29 02:02:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:02:51,673 INFO L225 Difference]: With dead ends: 141 [2023-11-29 02:02:51,673 INFO L226 Difference]: Without dead ends: 139 [2023-11-29 02:02:51,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:02:51,675 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:02:51,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:02:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-29 02:02:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2023-11-29 02:02:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-29 02:02:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2023-11-29 02:02:51,722 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 84 [2023-11-29 02:02:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:02:51,723 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2023-11-29 02:02:51,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2023-11-29 02:02:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 02:02:51,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:02:51,726 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:51,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:02:51,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:02:51,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 570239313, now seen corresponding path program 1 times [2023-11-29 02:02:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564856619] [2023-11-29 02:02:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:02:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:02:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:02:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:02:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:02:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:02:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:02:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:02:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:02:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:02:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:02:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:02:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:02:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 02:02:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564856619] [2023-11-29 02:02:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564856619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:02:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:02:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486249924] [2023-11-29 02:02:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:53,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:02:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:02:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:02:53,440 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:02:53,925 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2023-11-29 02:02:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:02:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-11-29 02:02:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:02:53,928 INFO L225 Difference]: With dead ends: 135 [2023-11-29 02:02:53,928 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 02:02:53,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:02:53,930 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:02:53,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:02:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 02:02:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2023-11-29 02:02:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-29 02:02:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2023-11-29 02:02:53,969 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 84 [2023-11-29 02:02:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:02:53,970 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2023-11-29 02:02:53,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 02:02:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2023-11-29 02:02:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 02:02:53,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:02:53,974 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:02:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:02:53,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:02:53,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:02:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2073291393, now seen corresponding path program 1 times [2023-11-29 02:02:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:02:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023552524] [2023-11-29 02:02:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:02:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:02:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:02:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:02:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:02:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:02:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:02:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:02:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:02:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:02:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:02:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:02:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:02:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:02:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 02:02:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:02:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 02:02:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:02:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:02:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 02:02:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:02:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 02:02:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:02:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 02:02:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:02:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 02:02:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:02:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-11-29 02:02:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:02:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023552524] [2023-11-29 02:02:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023552524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:02:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740524327] [2023-11-29 02:02:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:02:54,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:02:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:02:54,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:02:54,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:02:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:02:54,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:02:54,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-11-29 02:02:54,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:02:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740524327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:02:54,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:02:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-29 02:02:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902246085] [2023-11-29 02:02:54,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:02:54,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:02:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:02:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:02:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:02:54,529 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 02:02:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:02:54,596 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2023-11-29 02:02:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:02:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2023-11-29 02:02:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:02:54,598 INFO L225 Difference]: With dead ends: 164 [2023-11-29 02:02:54,599 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:02:54,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 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 02:02:54,602 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:02:54,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:02:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:02:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:02:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:02:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:02:54,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2023-11-29 02:02:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:02:54,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:02:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-11-29 02:02:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:02:54,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:02:54,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:02:54,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:02:54,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:02:54,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 02:02:55,954 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-11-29 02:02:55,955 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 02:02:55,955 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 02:02:55,955 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-11-29 02:02:55,955 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 02:02:55,956 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,956 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,956 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-29 02:02:55,956 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-29 02:02:55,957 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,957 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-29 02:02:55,957 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,957 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-29 02:02:55,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 02:02:55,957 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 02:02:55,958 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,958 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,958 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-29 02:02:55,958 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 02:02:55,958 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,959 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,959 INFO L895 garLoopResultBuilder]: At program point L95-3(lines 95 101) the Hoare annotation is: (let ((.cse3 (div ~var_1_14~0 256))) (let ((.cse0 (<= ~var_1_14~0 10)) (.cse1 (<= 0 .cse3)) (.cse2 (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse3)) 65536)))) (or (and (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse0 .cse1 .cse2) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse0 .cse1 .cse2)))) [2023-11-29 02:02:55,959 INFO L899 garLoopResultBuilder]: For program point L95-4(lines 95 101) no Hoare annotation was computed. [2023-11-29 02:02:55,959 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-29 02:02:55,959 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-11-29 02:02:55,959 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-29 02:02:55,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 02:02:55,960 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,960 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,960 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-11-29 02:02:55,960 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,961 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-29 02:02:55,961 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-29 02:02:55,961 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,961 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-11-29 02:02:55,961 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-29 02:02:55,961 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-29 02:02:55,962 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 02:02:55,962 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 02:02:55,962 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 02:02:55,962 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 02:02:55,966 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 02:02:55,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:02:55,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:02:55 BoogieIcfgContainer [2023-11-29 02:02:55,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:02:55,984 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:02:55,984 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:02:55,985 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:02:55,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:02:46" (3/4) ... [2023-11-29 02:02:55,988 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:02:55,992 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 02:02:56,000 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 02:02:56,001 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 02:02:56,001 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:02:56,002 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:02:56,121 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:02:56,122 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:02:56,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:02:56,123 INFO L158 Benchmark]: Toolchain (without parser) took 10142.89ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 123.1MB in the beginning and 154.3MB in the end (delta: -31.1MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,123 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:02:56,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.57ms. Allocated memory is still 159.4MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.54ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,125 INFO L158 Benchmark]: Boogie Preprocessor took 64.23ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,125 INFO L158 Benchmark]: RCFGBuilder took 521.27ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 128.6MB in the end (delta: -25.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,126 INFO L158 Benchmark]: TraceAbstraction took 8992.73ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 127.8MB in the beginning and 160.6MB in the end (delta: -32.8MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,126 INFO L158 Benchmark]: Witness Printer took 137.81ms. Allocated memory is still 232.8MB. Free memory was 160.6MB in the beginning and 154.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:02:56,129 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.25ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.57ms. Allocated memory is still 159.4MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.54ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 107.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.23ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 521.27ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 128.6MB in the end (delta: -25.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8992.73ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 127.8MB in the beginning and 160.6MB in the end (delta: -32.8MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. * Witness Printer took 137.81ms. Allocated memory is still 232.8MB. Free memory was 160.6MB in the beginning and 154.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 283 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 105 PreInvPairs, 121 NumberOfFragments, 476 HoareAnnotationTreeSize, 105 FomulaSimplifications, 1303 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 3365 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 3288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 3907/3908 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((1 <= k_loop) && (var_1_14 <= 10)) && (0 <= (var_1_14 / 256))) && (10 <= ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) || ((((((var_1_10 == 0) && (last_1_var_1_10 == 0)) && (0 <= k_loop)) && (var_1_14 <= 10)) && (0 <= (var_1_14 / 256))) && (10 <= ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)))) RESULT: Ultimate proved your program to be correct! [2023-11-29 02:02:56,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2572a0a-0f68-4be4-b3c8-46e7d7c0c053/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE