./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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 b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:48:15,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:48:15,415 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:48:15,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:48:15,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:48:15,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:48:15,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:48:15,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:48:15,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:48:15,446 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:48:15,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:48:15,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:48:15,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:48:15,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:48:15,449 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:48:15,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:48:15,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:48:15,450 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:48:15,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:48:15,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:48:15,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:48:15,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:48:15,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:48:15,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:48:15,453 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:48:15,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:48:15,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:48:15,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:48:15,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:48:15,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:48:15,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:48:15,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:48:15,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:48:15,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:48:15,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:48:15,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:48:15,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:48:15,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:48:15,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:48:15,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:48:15,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:48:15,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:48:15,459 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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 -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2023-11-29 03:48:15,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:48:15,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:48:15,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:48:15,683 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:48:15,683 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:48:15,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-11-29 03:48:18,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:48:18,677 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:48:18,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-11-29 03:48:18,687 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/a2f8d2f53/5537174a71de49e4b43a6e326e80f1c3/FLAG36ef31d05 [2023-11-29 03:48:18,701 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/a2f8d2f53/5537174a71de49e4b43a6e326e80f1c3 [2023-11-29 03:48:18,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:48:18,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:48:18,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:48:18,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:48:18,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:48:18,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:18,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455bd7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18, skipping insertion in model container [2023-11-29 03:48:18,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:18,743 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:48:18,866 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2023-11-29 03:48:18,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:48:18,935 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:48:18,946 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2023-11-29 03:48:18,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:48:18,994 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:48:18,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18 WrapperNode [2023-11-29 03:48:18,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:48:18,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:48:18,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:48:18,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:48:19,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,051 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2023-11-29 03:48:19,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:48:19,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:48:19,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:48:19,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:48:19,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:48:19,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:48:19,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:48:19,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:48:19,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:48:19,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (1/1) ... [2023-11-29 03:48:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:48:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:48:19,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:48:19,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:48:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:48:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:48:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:48:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:48:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:48:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:48:19,278 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:48:19,280 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:48:19,651 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:48:19,677 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:48:19,677 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:48:19,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:48:19 BoogieIcfgContainer [2023-11-29 03:48:19,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:48:19,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:48:19,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:48:19,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:48:19,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:48:18" (1/3) ... [2023-11-29 03:48:19,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec0effe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:48:19, skipping insertion in model container [2023-11-29 03:48:19,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:48:18" (2/3) ... [2023-11-29 03:48:19,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec0effe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:48:19, skipping insertion in model container [2023-11-29 03:48:19,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:48:19" (3/3) ... [2023-11-29 03:48:19,686 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2023-11-29 03:48:19,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:48:19,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:48:19,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:48:19,759 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;@76db0875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:48:19,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:48:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:48:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:48:19,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:19,777 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:19,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:19,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1566153101, now seen corresponding path program 1 times [2023-11-29 03:48:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544544624] [2023-11-29 03:48:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544544624] [2023-11-29 03:48:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544544624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:48:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623123170] [2023-11-29 03:48:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:20,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:48:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:48:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:48:20,131 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 03:48:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:20,165 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2023-11-29 03:48:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:48:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2023-11-29 03:48:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:20,175 INFO L225 Difference]: With dead ends: 137 [2023-11-29 03:48:20,176 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 03:48:20,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:48:20,183 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:20,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:48:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 03:48:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 03:48:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:48:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2023-11-29 03:48:20,237 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 105 [2023-11-29 03:48:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:20,238 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2023-11-29 03:48:20,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 03:48:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2023-11-29 03:48:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:48:20,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:20,251 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:20,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:48:20,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:20,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1182019631, now seen corresponding path program 1 times [2023-11-29 03:48:20,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109961089] [2023-11-29 03:48:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:20,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109961089] [2023-11-29 03:48:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109961089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:20,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:20,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:48:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480822622] [2023-11-29 03:48:20,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:48:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:48:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:48:20,526 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:20,608 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2023-11-29 03:48:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:48:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-11-29 03:48:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:20,612 INFO L225 Difference]: With dead ends: 188 [2023-11-29 03:48:20,613 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 03:48:20,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:48:20,631 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 92 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:20,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 232 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:48:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 03:48:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2023-11-29 03:48:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:48:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2023-11-29 03:48:20,646 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 105 [2023-11-29 03:48:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2023-11-29 03:48:20,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2023-11-29 03:48:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:48:20,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:20,650 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:20,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:48:20,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:20,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -923854193, now seen corresponding path program 1 times [2023-11-29 03:48:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64793612] [2023-11-29 03:48:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64793612] [2023-11-29 03:48:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64793612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:21,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:48:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631102429] [2023-11-29 03:48:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:48:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:48:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:48:21,038 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:21,203 INFO L93 Difference]: Finished difference Result 275 states and 418 transitions. [2023-11-29 03:48:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:48:21,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-11-29 03:48:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:21,208 INFO L225 Difference]: With dead ends: 275 [2023-11-29 03:48:21,208 INFO L226 Difference]: Without dead ends: 193 [2023-11-29 03:48:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:48:21,210 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 157 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:21,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 235 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:48:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-29 03:48:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2023-11-29 03:48:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:48:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 239 transitions. [2023-11-29 03:48:21,238 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 239 transitions. Word has length 105 [2023-11-29 03:48:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:21,239 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 239 transitions. [2023-11-29 03:48:21,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 239 transitions. [2023-11-29 03:48:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 03:48:21,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:21,242 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:21,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:48:21,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:21,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -243836417, now seen corresponding path program 1 times [2023-11-29 03:48:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659564073] [2023-11-29 03:48:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659564073] [2023-11-29 03:48:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659564073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:48:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877793726] [2023-11-29 03:48:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:21,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:48:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:48:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:48:21,649 INFO L87 Difference]: Start difference. First operand 159 states and 239 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:21,949 INFO L93 Difference]: Finished difference Result 396 states and 592 transitions. [2023-11-29 03:48:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:48:21,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2023-11-29 03:48:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:21,954 INFO L225 Difference]: With dead ends: 396 [2023-11-29 03:48:21,954 INFO L226 Difference]: Without dead ends: 238 [2023-11-29 03:48:21,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:48:21,957 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:21,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 420 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:48:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-29 03:48:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 218. [2023-11-29 03:48:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 166 states have internal predecessors, (227), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:48:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2023-11-29 03:48:21,992 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 106 [2023-11-29 03:48:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:21,993 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2023-11-29 03:48:21,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2023-11-29 03:48:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:48:21,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:21,996 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:21,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:48:21,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:21,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash -448602503, now seen corresponding path program 1 times [2023-11-29 03:48:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404997938] [2023-11-29 03:48:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404997938] [2023-11-29 03:48:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404997938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:22,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:22,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:48:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621062560] [2023-11-29 03:48:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:22,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:48:22,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:48:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:48:22,206 INFO L87 Difference]: Start difference. First operand 218 states and 323 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:22,239 INFO L93 Difference]: Finished difference Result 391 states and 579 transitions. [2023-11-29 03:48:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:48:22,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 03:48:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:22,243 INFO L225 Difference]: With dead ends: 391 [2023-11-29 03:48:22,243 INFO L226 Difference]: Without dead ends: 219 [2023-11-29 03:48:22,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:48:22,246 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:22,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:48:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-29 03:48:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-11-29 03:48:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 167 states have internal predecessors, (226), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:48:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2023-11-29 03:48:22,270 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 107 [2023-11-29 03:48:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:22,270 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2023-11-29 03:48:22,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2023-11-29 03:48:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:48:22,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:22,273 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:22,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:48:22,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:22,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash -841629513, now seen corresponding path program 1 times [2023-11-29 03:48:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250188240] [2023-11-29 03:48:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250188240] [2023-11-29 03:48:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250188240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:22,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:48:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192629011] [2023-11-29 03:48:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:22,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:48:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:48:22,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:48:22,529 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:22,873 INFO L93 Difference]: Finished difference Result 370 states and 548 transitions. [2023-11-29 03:48:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:48:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 03:48:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:22,877 INFO L225 Difference]: With dead ends: 370 [2023-11-29 03:48:22,877 INFO L226 Difference]: Without dead ends: 287 [2023-11-29 03:48:22,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:48:22,879 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 182 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:22,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 329 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:48:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-29 03:48:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 224. [2023-11-29 03:48:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 172 states have internal predecessors, (234), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:48:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2023-11-29 03:48:22,910 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 107 [2023-11-29 03:48:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:22,910 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2023-11-29 03:48:22,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2023-11-29 03:48:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:48:22,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:22,912 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:22,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:48:22,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:22,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash 696210482, now seen corresponding path program 1 times [2023-11-29 03:48:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087848204] [2023-11-29 03:48:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087848204] [2023-11-29 03:48:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087848204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:48:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123286684] [2023-11-29 03:48:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:48:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:48:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:48:23,284 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:23,377 INFO L93 Difference]: Finished difference Result 388 states and 576 transitions. [2023-11-29 03:48:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:48:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 03:48:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:23,380 INFO L225 Difference]: With dead ends: 388 [2023-11-29 03:48:23,381 INFO L226 Difference]: Without dead ends: 224 [2023-11-29 03:48:23,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:48:23,383 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 95 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:23,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 340 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:48:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-29 03:48:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2023-11-29 03:48:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 172 states have internal predecessors, (228), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 03:48:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 324 transitions. [2023-11-29 03:48:23,425 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 324 transitions. Word has length 107 [2023-11-29 03:48:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:23,426 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 324 transitions. [2023-11-29 03:48:23,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 324 transitions. [2023-11-29 03:48:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:48:23,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:23,428 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:23,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:48:23,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:23,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1617080335, now seen corresponding path program 1 times [2023-11-29 03:48:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847974914] [2023-11-29 03:48:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:48:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:48:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:48:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:48:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:48:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:48:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:48:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:48:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:48:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:48:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:48:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:48:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:48:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:48:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:48:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:48:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:48:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:48:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847974914] [2023-11-29 03:48:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847974914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:48:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:48:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:48:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805589493] [2023-11-29 03:48:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:48:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:48:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:48:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:48:23,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:48:23,655 INFO L87 Difference]: Start difference. First operand 224 states and 324 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:24,223 INFO L93 Difference]: Finished difference Result 598 states and 857 transitions. [2023-11-29 03:48:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:48:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-11-29 03:48:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:24,228 INFO L225 Difference]: With dead ends: 598 [2023-11-29 03:48:24,228 INFO L226 Difference]: Without dead ends: 510 [2023-11-29 03:48:24,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:48:24,229 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 245 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:24,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 419 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:48:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-11-29 03:48:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 396. [2023-11-29 03:48:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.3258064516129033) internal successors, (411), 310 states have internal predecessors, (411), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 03:48:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 571 transitions. [2023-11-29 03:48:24,332 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 571 transitions. Word has length 111 [2023-11-29 03:48:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:24,333 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 571 transitions. [2023-11-29 03:48:24,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:48:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 571 transitions. [2023-11-29 03:48:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:48:24,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:24,334 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:48:24,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:48:24,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:48:24,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1212301883, now seen corresponding path program 1 times [2023-11-29 03:48:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:48:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207989044] [2023-11-29 03:48:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:48:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,448 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:49:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:49:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:49:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:49:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:49:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:49:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:49:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:49:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:49:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:49:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:49:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:49:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:49:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:49:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:49:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:49:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:49:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:49:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:49:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207989044] [2023-11-29 03:49:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207989044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:49:10,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:49:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:49:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994149837] [2023-11-29 03:49:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:49:10,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:49:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:49:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:49:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:49:10,561 INFO L87 Difference]: Start difference. First operand 396 states and 571 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:12,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:49:32,169 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:49:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:49:38,188 INFO L93 Difference]: Finished difference Result 908 states and 1276 transitions. [2023-11-29 03:49:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:49:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-11-29 03:49:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:49:38,193 INFO L225 Difference]: With dead ends: 908 [2023-11-29 03:49:38,193 INFO L226 Difference]: Without dead ends: 744 [2023-11-29 03:49:38,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:49:38,195 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 242 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:49:38,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 492 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 03:49:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-11-29 03:49:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 666. [2023-11-29 03:49:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 568 states have (on average 1.3380281690140845) internal successors, (760), 572 states have internal predecessors, (760), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 03:49:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 936 transitions. [2023-11-29 03:49:38,334 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 936 transitions. Word has length 111 [2023-11-29 03:49:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:49:38,335 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 936 transitions. [2023-11-29 03:49:38,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 936 transitions. [2023-11-29 03:49:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:49:38,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:38,337 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:38,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:49:38,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:38,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 394653433, now seen corresponding path program 1 times [2023-11-29 03:49:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:49:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028379668] [2023-11-29 03:49:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:49:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:49:38,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:49:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:49:38,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:49:38,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:49:38,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:49:38,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:49:38,445 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:38,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:49:38,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 03:49:38,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 03:49:38,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 03:49:38,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 03:49:38,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 03:49:38,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated [2023-11-29 03:49:38,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:49:38,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 03:49:38,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 03:49:38,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:49:38 BoogieIcfgContainer [2023-11-29 03:49:38,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:49:38,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:49:38,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:49:38,524 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:49:38,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:48:19" (3/4) ... [2023-11-29 03:49:38,526 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:49:38,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:49:38,527 INFO L158 Benchmark]: Toolchain (without parser) took 79820.19ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 118.4MB in the beginning and 145.1MB in the end (delta: -26.7MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,527 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:49:38,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.99ms. Allocated memory is still 157.3MB. Free memory was 118.1MB in the beginning and 104.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.35ms. Allocated memory is still 157.3MB. Free memory was 104.5MB in the beginning and 100.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,528 INFO L158 Benchmark]: Boogie Preprocessor took 63.92ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 94.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,528 INFO L158 Benchmark]: RCFGBuilder took 560.25ms. Allocated memory is still 157.3MB. Free memory was 94.5MB in the beginning and 123.9MB in the end (delta: -29.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,528 INFO L158 Benchmark]: TraceAbstraction took 78843.33ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 123.1MB in the beginning and 146.1MB in the end (delta: -23.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2023-11-29 03:49:38,529 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 226.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:49:38,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.99ms. Allocated memory is still 157.3MB. Free memory was 118.1MB in the beginning and 104.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.35ms. Allocated memory is still 157.3MB. Free memory was 104.5MB in the beginning and 100.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.92ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 94.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 560.25ms. Allocated memory is still 157.3MB. Free memory was 94.5MB in the beginning and 123.9MB in the end (delta: -29.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 78843.33ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 123.1MB in the beginning and 146.1MB in the end (delta: -23.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 226.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_5 = var_1_5 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L87] var_1_9 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L88] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L89] var_1_10 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L90] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] var_1_23 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L111] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L125] RET updateVariables() [L126] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] COND TRUE (var_1_20 + var_1_15) < -200 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L62] COND FALSE !(\read(var_1_22)) [L69] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L74] COND FALSE !(256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !(var_1_22 || var_1_22) [L82] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117-L118] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=68, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.7s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1093 mSDsluCounter, 2768 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1600 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 1168 mSDtfsCounter, 984 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 38.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 347 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 48.2s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 11792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:49:38,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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 b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:49:40,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:49:40,443 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:49:40,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:49:40,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:49:40,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:49:40,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:49:40,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:49:40,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:49:40,478 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:49:40,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:49:40,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:49:40,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:49:40,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:49:40,481 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:49:40,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:49:40,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:49:40,482 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:49:40,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:49:40,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:49:40,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:49:40,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:49:40,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:49:40,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:49:40,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:49:40,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:49:40,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:49:40,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:49:40,488 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:49:40,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:49:40,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:49:40,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:49:40,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:49:40,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:49:40,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:49:40,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:49:40,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:49:40,491 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:49:40,491 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:49:40,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:49:40,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:49:40,492 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:49:40,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:49:40,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:49:40,492 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:49:40,492 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/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 -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2023-11-29 03:49:40,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:49:40,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:49:40,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:49:40,815 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:49:40,816 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:49:40,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-11-29 03:49:43,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:49:43,863 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:49:43,864 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-11-29 03:49:43,874 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/e19f6983d/0e8f76840df34a8e81b4bace7222076b/FLAGb3add8320 [2023-11-29 03:49:43,889 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/data/e19f6983d/0e8f76840df34a8e81b4bace7222076b [2023-11-29 03:49:43,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:49:43,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:49:43,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:49:43,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:49:43,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:49:43,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:49:43" (1/1) ... [2023-11-29 03:49:43,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1151cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:43, skipping insertion in model container [2023-11-29 03:49:43,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:49:43" (1/1) ... [2023-11-29 03:49:43,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:49:44,081 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2023-11-29 03:49:44,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:49:44,148 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:49:44,162 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_9c146dfd-4762-478c-a7c7-c6bbc824cca6/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2023-11-29 03:49:44,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:49:44,210 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:49:44,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44 WrapperNode [2023-11-29 03:49:44,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:49:44,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:49:44,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:49:44,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:49:44,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,258 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-11-29 03:49:44,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:49:44,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:49:44,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:49:44,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:49:44,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:49:44,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:49:44,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:49:44,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:49:44,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:49:44,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (1/1) ... [2023-11-29 03:49:44,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:49:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:49:44,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:49:44,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:49:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:49:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:49:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:49:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:49:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:49:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:49:44,468 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:49:44,470 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:49:44,753 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:49:44,799 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:49:44,799 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:49:44,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:49:44 BoogieIcfgContainer [2023-11-29 03:49:44,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:49:44,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:49:44,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:49:44,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:49:44,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:49:43" (1/3) ... [2023-11-29 03:49:44,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b086d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:49:44, skipping insertion in model container [2023-11-29 03:49:44,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:49:44" (2/3) ... [2023-11-29 03:49:44,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b086d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:49:44, skipping insertion in model container [2023-11-29 03:49:44,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:49:44" (3/3) ... [2023-11-29 03:49:44,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2023-11-29 03:49:44,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:49:44,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:49:44,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:49:44,888 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;@1942cfc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:49:44,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:49:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:49:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 03:49:44,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:44,907 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:44,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:44,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 669502656, now seen corresponding path program 1 times [2023-11-29 03:49:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:49:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486265757] [2023-11-29 03:49:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:44,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:49:44,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:49:44,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:49:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:45,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:49:45,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:49:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 03:49:45,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:49:45,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:49:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486265757] [2023-11-29 03:49:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486265757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:49:45,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:49:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:49:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340696137] [2023-11-29 03:49:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:49:45,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:49:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:49:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:49:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:49:45,310 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:49:45,706 INFO L93 Difference]: Finished difference Result 102 states and 174 transitions. [2023-11-29 03:49:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:49:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 03:49:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:49:45,718 INFO L225 Difference]: With dead ends: 102 [2023-11-29 03:49:45,719 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 03:49:45,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:49:45,726 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:49:45,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 79 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:49:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 03:49:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-29 03:49:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:49:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-11-29 03:49:45,773 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 101 [2023-11-29 03:49:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:49:45,774 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-11-29 03:49:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-11-29 03:49:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 03:49:45,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:45,780 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:45,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:49:45,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:45,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:45,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash -139843970, now seen corresponding path program 1 times [2023-11-29 03:49:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:49:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732189385] [2023-11-29 03:49:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:49:45,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:49:45,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:49:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:46,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:49:46,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:49:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:49:46,422 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:49:46,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:49:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732189385] [2023-11-29 03:49:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732189385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:49:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:49:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:49:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738245027] [2023-11-29 03:49:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:49:46,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:49:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:49:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:49:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:49:46,427 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:49:46,628 INFO L93 Difference]: Finished difference Result 133 states and 182 transitions. [2023-11-29 03:49:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:49:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 03:49:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:49:46,631 INFO L225 Difference]: With dead ends: 133 [2023-11-29 03:49:46,632 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 03:49:46,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:49:46,634 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:49:46,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 115 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:49:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 03:49:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2023-11-29 03:49:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:49:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2023-11-29 03:49:46,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 101 [2023-11-29 03:49:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:49:46,656 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2023-11-29 03:49:46,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2023-11-29 03:49:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 03:49:46,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:46,658 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:46,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:49:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:46,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:46,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -449822937, now seen corresponding path program 1 times [2023-11-29 03:49:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:49:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519478779] [2023-11-29 03:49:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:46,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:49:46,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:49:46,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:49:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:46,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:49:46,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:49:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 03:49:47,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:49:47,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:49:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519478779] [2023-11-29 03:49:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519478779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:49:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:49:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:49:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283268821] [2023-11-29 03:49:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:49:47,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:49:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:49:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:49:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:49:47,606 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:49:47,790 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2023-11-29 03:49:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:49:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-11-29 03:49:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:49:47,794 INFO L225 Difference]: With dead ends: 146 [2023-11-29 03:49:47,794 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 03:49:47,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:49:47,796 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 30 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:49:47,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 165 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:49:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 03:49:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-11-29 03:49:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:49:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2023-11-29 03:49:47,830 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 102 [2023-11-29 03:49:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:49:47,831 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2023-11-29 03:49:47,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 03:49:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2023-11-29 03:49:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:49:47,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:49:47,834 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:49:47,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 03:49:48,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:48,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:49:48,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:49:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1059729236, now seen corresponding path program 1 times [2023-11-29 03:49:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:49:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850084545] [2023-11-29 03:49:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:49:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:49:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:49:48,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:49:48,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c146dfd-4762-478c-a7c7-c6bbc824cca6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:49:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:49:48,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 03:49:48,190 INFO L285 TraceCheckSpWp]: Computing forward predicates...