./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU --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 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:16,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:16,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:16,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:16,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:16,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:16,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:16,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:16,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:16,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:16,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:16,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:16,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:16,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:16,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:16,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:16,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:16,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:16,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:16,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:16,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:16,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:16,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:16,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:16,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:16,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:16,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:16,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:16,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:16,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:16,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:16,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:16,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:16,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:16,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:16,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:16,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:16,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:16,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:16,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:16,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:16,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:16,129 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2024-10-31 22:17:16,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:16,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:16,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:16,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:16,492 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:16,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i Unable to find full path for "g++" [2024-10-31 22:17:18,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:18,888 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:18,889 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2024-10-31 22:17:18,911 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data/78512baf7/6146e87b5be0478faf3a30fedc222664/FLAG842581f31 [2024-10-31 22:17:18,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data/78512baf7/6146e87b5be0478faf3a30fedc222664 [2024-10-31 22:17:18,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:18,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:18,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:18,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:18,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:18,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4698ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18, skipping insertion in model container [2024-10-31 22:17:18,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:19,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:19,286 WARN L251 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i[916,929] [2024-10-31 22:17:19,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:19,414 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:19,425 WARN L251 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i[916,929] [2024-10-31 22:17:19,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:19,513 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:19,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19 WrapperNode [2024-10-31 22:17:19,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:19,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:19,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:19,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:19,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,633 INFO L138 Inliner]: procedures = 30, calls = 243, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 764 [2024-10-31 22:17:19,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:19,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:19,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:19,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:19,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,671 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-31 22:17:19,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:19,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:19,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:19,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:19,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:19,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:19,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-10-31 22:17:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-10-31 22:17:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-10-31 22:17:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:17:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-10-31 22:17:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:17:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:17:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:20,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:20,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:21,391 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:21,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:21,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:21,413 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:21,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:21 BoogieIcfgContainer [2024-10-31 22:17:21,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:21,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:21,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:21,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:21,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:18" (1/3) ... [2024-10-31 22:17:21,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aef351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:21, skipping insertion in model container [2024-10-31 22:17:21,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (2/3) ... [2024-10-31 22:17:21,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aef351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:21, skipping insertion in model container [2024-10-31 22:17:21,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:21" (3/3) ... [2024-10-31 22:17:21,423 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-86.i [2024-10-31 22:17:21,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:21,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:21,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:21,518 INFO L333 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, 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;@19a222fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:21,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 132 states have internal predecessors, (188), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 22:17:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-31 22:17:21,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:21,542 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:21,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:21,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash -665917478, now seen corresponding path program 1 times [2024-10-31 22:17:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613774654] [2024-10-31 22:17:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:17:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613774654] [2024-10-31 22:17:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613774654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572920288] [2024-10-31 22:17:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:22,300 INFO L87 Difference]: Start difference. First operand has 159 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 132 states have internal predecessors, (188), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:22,360 INFO L93 Difference]: Finished difference Result 311 states and 495 transitions. [2024-10-31 22:17:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-10-31 22:17:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:22,377 INFO L225 Difference]: With dead ends: 311 [2024-10-31 22:17:22,377 INFO L226 Difference]: Without dead ends: 155 [2024-10-31 22:17:22,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:22,387 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-31 22:17:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-31 22:17:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 22:17:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-31 22:17:22,453 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 185 [2024-10-31 22:17:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:22,453 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-31 22:17:22,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-31 22:17:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-31 22:17:22,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:22,459 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:22,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:22,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash 238950816, now seen corresponding path program 1 times [2024-10-31 22:17:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26515368] [2024-10-31 22:17:22,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:17:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26515368] [2024-10-31 22:17:23,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26515368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:23,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:23,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691389622] [2024-10-31 22:17:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:23,120 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:17:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:23,220 INFO L93 Difference]: Finished difference Result 310 states and 463 transitions. [2024-10-31 22:17:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-31 22:17:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:23,226 INFO L225 Difference]: With dead ends: 310 [2024-10-31 22:17:23,228 INFO L226 Difference]: Without dead ends: 158 [2024-10-31 22:17:23,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:23,230 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:23,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 675 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-31 22:17:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2024-10-31 22:17:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-31 22:17:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-10-31 22:17:23,263 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 185 [2024-10-31 22:17:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-10-31 22:17:23,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:17:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-10-31 22:17:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-31 22:17:23,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:23,275 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:23,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash 240797858, now seen corresponding path program 1 times [2024-10-31 22:17:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717119725] [2024-10-31 22:17:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:17:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717119725] [2024-10-31 22:17:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717119725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:24,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576835973] [2024-10-31 22:17:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:24,738 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:17:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:25,581 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2024-10-31 22:17:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:25,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-31 22:17:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:25,584 INFO L225 Difference]: With dead ends: 410 [2024-10-31 22:17:25,584 INFO L226 Difference]: Without dead ends: 256 [2024-10-31 22:17:25,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:25,586 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 129 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:25,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 779 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:17:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-31 22:17:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2024-10-31 22:17:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 219 states have (on average 1.4337899543378996) internal successors, (314), 220 states have internal predecessors, (314), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:17:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 376 transitions. [2024-10-31 22:17:25,613 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 376 transitions. Word has length 185 [2024-10-31 22:17:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 376 transitions. [2024-10-31 22:17:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-31 22:17:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 376 transitions. [2024-10-31 22:17:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-31 22:17:25,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:25,617 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:25,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:25,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 816782759, now seen corresponding path program 1 times [2024-10-31 22:17:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018414994] [2024-10-31 22:17:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:17:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018414994] [2024-10-31 22:17:29,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018414994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130618824] [2024-10-31 22:17:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:29,054 INFO L87 Difference]: Start difference. First operand 253 states and 376 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:29,910 INFO L93 Difference]: Finished difference Result 500 states and 743 transitions. [2024-10-31 22:17:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:17:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2024-10-31 22:17:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:29,916 INFO L225 Difference]: With dead ends: 500 [2024-10-31 22:17:29,916 INFO L226 Difference]: Without dead ends: 250 [2024-10-31 22:17:29,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:29,918 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 106 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:29,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 738 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:17:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-31 22:17:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-10-31 22:17:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.4205607476635513) internal successors, (304), 215 states have internal predecessors, (304), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:17:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 366 transitions. [2024-10-31 22:17:29,941 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 366 transitions. Word has length 187 [2024-10-31 22:17:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:29,942 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 366 transitions. [2024-10-31 22:17:29,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 366 transitions. [2024-10-31 22:17:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-31 22:17:29,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:29,946 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:29,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:29,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -204285595, now seen corresponding path program 1 times [2024-10-31 22:17:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558858971] [2024-10-31 22:17:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-31 22:17:32,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:32,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558858971] [2024-10-31 22:17:32,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558858971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:32,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233503572] [2024-10-31 22:17:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:32,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:32,705 INFO L87 Difference]: Start difference. First operand 248 states and 366 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:33,614 INFO L93 Difference]: Finished difference Result 495 states and 730 transitions. [2024-10-31 22:17:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:17:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2024-10-31 22:17:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:33,617 INFO L225 Difference]: With dead ends: 495 [2024-10-31 22:17:33,617 INFO L226 Difference]: Without dead ends: 250 [2024-10-31 22:17:33,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:33,618 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 102 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:33,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 884 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:17:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-31 22:17:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-10-31 22:17:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 215 states have internal predecessors, (303), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:17:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 365 transitions. [2024-10-31 22:17:33,649 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 365 transitions. Word has length 187 [2024-10-31 22:17:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:33,650 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 365 transitions. [2024-10-31 22:17:33,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-31 22:17:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 365 transitions. [2024-10-31 22:17:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-31 22:17:33,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:33,655 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:33,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:33,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 768425565, now seen corresponding path program 1 times [2024-10-31 22:17:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067251936] [2024-10-31 22:17:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:17:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 22:17:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:17:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:17:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 22:17:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:17:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:17:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 22:17:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 22:17:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:17:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:17:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:17:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:17:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 22:17:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-31 22:17:35,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067251936] [2024-10-31 22:17:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067251936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:17:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464949059] [2024-10-31 22:17:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:35,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:17:35,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:35,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:17:35,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:17:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:35,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-31 22:17:36,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:36,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:17:36,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-10-31 22:17:36,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:17:36,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-31 22:17:36,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:17:36,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2024-10-31 22:17:36,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:17:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 19 [2024-10-31 22:17:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 162 proven. 3 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-31 22:17:36,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:17:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-31 22:17:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464949059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:17:36,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:17:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-10-31 22:17:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191806248] [2024-10-31 22:17:36,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:17:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-31 22:17:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 22:17:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:17:36,719 INFO L87 Difference]: Start difference. First operand 248 states and 365 transitions. Second operand has 19 states, 16 states have (on average 8.0625) internal successors, (129), 19 states have internal predecessors, (129), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2024-10-31 22:17:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:39,908 INFO L93 Difference]: Finished difference Result 591 states and 859 transitions. [2024-10-31 22:17:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-31 22:17:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.0625) internal successors, (129), 19 states have internal predecessors, (129), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) Word has length 187 [2024-10-31 22:17:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:39,912 INFO L225 Difference]: With dead ends: 591 [2024-10-31 22:17:39,912 INFO L226 Difference]: Without dead ends: 346 [2024-10-31 22:17:39,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=459, Invalid=1521, Unknown=0, NotChecked=0, Total=1980 [2024-10-31 22:17:39,920 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1274 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:39,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 597 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-31 22:17:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-31 22:17:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 252. [2024-10-31 22:17:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 217 states have (on average 1.400921658986175) internal successors, (304), 218 states have internal predecessors, (304), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:17:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 366 transitions. [2024-10-31 22:17:39,958 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 366 transitions. Word has length 187 [2024-10-31 22:17:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:39,959 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 366 transitions. [2024-10-31 22:17:39,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.0625) internal successors, (129), 19 states have internal predecessors, (129), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2024-10-31 22:17:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 366 transitions. [2024-10-31 22:17:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-31 22:17:39,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:39,963 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:39,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:17:40,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 22:17:40,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:40,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -521316907, now seen corresponding path program 1 times [2024-10-31 22:17:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:40,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401107116] [2024-10-31 22:17:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:40,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:17:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:40,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:17:40,604 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:17:40,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:17:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:17:40,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:40,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:17:40,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:17:40 BoogieIcfgContainer [2024-10-31 22:17:40,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:17:40,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:17:40,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:17:40,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:17:40,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:21" (3/4) ... [2024-10-31 22:17:40,721 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:17:40,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:17:40,722 INFO L158 Benchmark]: Toolchain (without parser) took 21780.36ms. Allocated memory was 157.3MB in the beginning and 572.5MB in the end (delta: 415.2MB). Free memory was 117.2MB in the beginning and 342.0MB in the end (delta: -224.8MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,723 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:40,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.08ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 93.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.77ms. Allocated memory is still 157.3MB. Free memory was 93.7MB in the beginning and 126.7MB in the end (delta: -33.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,723 INFO L158 Benchmark]: Boogie Preprocessor took 86.23ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,724 INFO L158 Benchmark]: RCFGBuilder took 1691.78ms. Allocated memory is still 157.3MB. Free memory was 120.6MB in the beginning and 69.4MB in the end (delta: 51.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,724 INFO L158 Benchmark]: TraceAbstraction took 19300.46ms. Allocated memory was 157.3MB in the beginning and 572.5MB in the end (delta: 415.2MB). Free memory was 69.0MB in the beginning and 342.0MB in the end (delta: -273.0MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:40,725 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 572.5MB. Free memory is still 342.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:40,726 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.34ms. Allocated memory is still 109.1MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.08ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 93.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.77ms. Allocated memory is still 157.3MB. Free memory was 93.7MB in the beginning and 126.7MB in the end (delta: -33.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.23ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1691.78ms. Allocated memory is still 157.3MB. Free memory was 120.6MB in the beginning and 69.4MB in the end (delta: 51.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19300.46ms. Allocated memory was 157.3MB in the beginning and 572.5MB in the end (delta: 415.2MB). Free memory was 69.0MB in the beginning and 342.0MB in the end (delta: -273.0MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 572.5MB. Free memory is still 342.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 130, overapproximation of shiftLeft at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L124] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] RET updateVariables() [L139] CALL step() [L66] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] COND FALSE !(! WrapperStruct00.var_1_2) [L69] EXPR WrapperStruct00.var_1_5 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_5 [L71] signed short int stepLocal_0 = WrapperStruct00.var_1_5; [L72] COND TRUE stepLocal_0 > 2 [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] WrapperStruct00.var_1_7 = ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10) [L75] EXPR WrapperStruct00.var_1_17 [L75] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_17 [L76] EXPR WrapperStruct00.var_1_2 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_12 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) [L79] EXPR WrapperStruct00.var_1_3 [L79] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR -25 << WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] COND FALSE !(WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) [L82] EXPR WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) [L130] EXPR WrapperStruct00.var_1_1 [L130] EXPR WrapperStruct00.var_1_5 [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) [L130] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 [L130] EXPR WrapperStruct00.var_1_7 [L130] EXPR WrapperStruct00.var_1_8 [L130] EXPR WrapperStruct00.var_1_9 [L130] EXPR WrapperStruct00.var_1_10 [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130-L131] return ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1614 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1612 mSDsluCounter, 3904 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2624 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3105 IncrementalHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 1280 mSDtfsCounter, 3105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 739 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=3, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 102 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1482 ConstructedInterpolants, 0 QuantifiedInterpolants, 2535 SizeOfPredicates, 4 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9591/9600 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 [2024-10-31 22:17:40,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU --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 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:43,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:43,578 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:17:43,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:43,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:43,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:43,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:43,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:43,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:43,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:43,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:43,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:43,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:43,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:43,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:43,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:43,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:43,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:43,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:43,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:43,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:43,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:43,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:43,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:17:43,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:17:43,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:43,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:17:43,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:43,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:43,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:43,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:43,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:43,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:43,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:43,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:43,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:43,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:43,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:43,645 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:17:43,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:17:43,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:43,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:43,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:43,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:43,647 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:17:43,647 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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/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_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2024-10-31 22:17:44,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:44,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:44,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:44,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:44,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:44,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a5d8d3-8107-45fc-8c61-62044b9ec62c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i