./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX --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 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:04:45,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:04:45,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:04:45,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:04:45,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:04:45,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:04:45,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:04:45,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:04:45,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:04:45,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:04:45,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:04:45,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:04:45,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:04:45,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:04:45,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:04:45,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:04:45,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:04:45,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:04:45,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:04:45,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:04:45,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:04:45,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:04:45,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:04:45,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:04:45,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:04:45,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:04:45,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:04:45,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:04:45,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:04:46,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:04:46,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:04:46,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:04:46,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:46,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:04:46,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:04:46,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:04:46,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:04:46,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:04:46,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:04:46,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:04:46,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:04:46,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:04:46,004 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX 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 -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2024-11-08 16:04:46,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:04:46,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:04:46,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:04:46,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:04:46,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:04:46,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i Unable to find full path for "g++" [2024-11-08 16:04:48,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:04:48,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:04:48,604 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-08 16:04:48,614 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/83984bb9c/a55a38ab7dad4b388043a8a66ffbb170/FLAG5d55d4f3f [2024-11-08 16:04:48,638 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/83984bb9c/a55a38ab7dad4b388043a8a66ffbb170 [2024-11-08 16:04:48,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:04:48,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:04:48,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:48,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:04:48,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:04:48,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:48" (1/1) ... [2024-11-08 16:04:48,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ec625e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:48, skipping insertion in model container [2024-11-08 16:04:48,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:48" (1/1) ... [2024-11-08 16:04:48,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:04:48,951 WARN L250 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-11-08 16:04:49,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:49,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:04:49,060 WARN L250 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-11-08 16:04:49,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:49,122 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:04:49,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49 WrapperNode [2024-11-08 16:04:49,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:49,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:49,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:04:49,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:04:49,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,186 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-08 16:04:49,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:49,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:04:49,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:04:49,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:04:49,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,219 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:04:49,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:04:49,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:04:49,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:04:49,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:04:49,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (1/1) ... [2024-11-08 16:04:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:49,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:04:49,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:04:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:04:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:04:49,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:04:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:04:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:04:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:04:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:04:49,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:04:49,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:04:49,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:04:49,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:04:49,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:04:49,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:04:49,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:04:50,263 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-08 16:04:50,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:04:50,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:04:50,281 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:04:50,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:50 BoogieIcfgContainer [2024-11-08 16:04:50,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:04:50,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:04:50,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:04:50,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:04:50,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:04:48" (1/3) ... [2024-11-08 16:04:50,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454fa030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:50, skipping insertion in model container [2024-11-08 16:04:50,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:49" (2/3) ... [2024-11-08 16:04:50,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454fa030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:50, skipping insertion in model container [2024-11-08 16:04:50,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:50" (3/3) ... [2024-11-08 16:04:50,294 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-08 16:04:50,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:04:50,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:04:50,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:04:50,385 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;@592b9848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:04:50,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:04:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:04:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 16:04:50,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:50,400 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:50,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:50,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2023134190, now seen corresponding path program 1 times [2024-11-08 16:04:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098125391] [2024-11-08 16:04:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:04:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098125391] [2024-11-08 16:04:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098125391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:04:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922225268] [2024-11-08 16:04:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:04:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:04:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:50,900 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:50,931 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-08 16:04:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:04:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-08 16:04:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:50,944 INFO L225 Difference]: With dead ends: 203 [2024-11-08 16:04:50,944 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 16:04:50,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-11-08 16:04:50,952 INFO L432 NwaCegarLoop]: 146 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, 146 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-11-08 16:04:50,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 16:04:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 16:04:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:04:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-08 16:04:51,038 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-08 16:04:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:51,040 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-08 16:04:51,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-08 16:04:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 16:04:51,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:51,046 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:51,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:04:51,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -34749292, now seen corresponding path program 1 times [2024-11-08 16:04:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376786091] [2024-11-08 16:04:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:04:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376786091] [2024-11-08 16:04:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376786091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:04:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695743818] [2024-11-08 16:04:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:04:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:04:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:51,526 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:51,593 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2024-11-08 16:04:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:04:51,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-08 16:04:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:51,600 INFO L225 Difference]: With dead ends: 201 [2024-11-08 16:04:51,600 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 16:04:51,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-11-08 16:04:51,602 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:51,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 16:04:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-08 16:04:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:04:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-08 16:04:51,627 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 90 [2024-11-08 16:04:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:51,629 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-08 16:04:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-08 16:04:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 16:04:51,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:51,636 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:51,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:04:51,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:51,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1573089322, now seen corresponding path program 1 times [2024-11-08 16:04:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:51,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185037369] [2024-11-08 16:04:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:04:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185037369] [2024-11-08 16:04:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185037369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:54,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:04:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465948980] [2024-11-08 16:04:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:04:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:04:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:04:54,442 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:55,873 INFO L93 Difference]: Finished difference Result 374 states and 543 transitions. [2024-11-08 16:04:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:04:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-08 16:04:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:55,878 INFO L225 Difference]: With dead ends: 374 [2024-11-08 16:04:55,878 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 16:04:55,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:04:55,881 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 372 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:55,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 458 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:04:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 16:04:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 152. [2024-11-08 16:04:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.381679389312977) internal successors, (181), 131 states have internal predecessors, (181), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:04:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 217 transitions. [2024-11-08 16:04:55,931 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 217 transitions. Word has length 90 [2024-11-08 16:04:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 217 transitions. [2024-11-08 16:04:55,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:04:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 217 transitions. [2024-11-08 16:04:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 16:04:55,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:55,935 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:55,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:04:55,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -797336751, now seen corresponding path program 1 times [2024-11-08 16:04:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801022820] [2024-11-08 16:04:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:04:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801022820] [2024-11-08 16:04:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801022820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:56,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:04:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859850648] [2024-11-08 16:04:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:56,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:04:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:04:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:56,622 INFO L87 Difference]: Start difference. First operand 152 states and 217 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:04:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:56,982 INFO L93 Difference]: Finished difference Result 334 states and 482 transitions. [2024-11-08 16:04:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:04:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-08 16:04:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:56,985 INFO L225 Difference]: With dead ends: 334 [2024-11-08 16:04:56,985 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 16:04:56,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:56,987 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 180 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:56,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 530 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:04:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 16:04:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 153. [2024-11-08 16:04:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.378787878787879) internal successors, (182), 132 states have internal predecessors, (182), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:04:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-08 16:04:57,021 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 91 [2024-11-08 16:04:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-08 16:04:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:04:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-08 16:04:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 16:04:57,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:57,024 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:04:57,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1650508409, now seen corresponding path program 1 times [2024-11-08 16:04:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703784023] [2024-11-08 16:04:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:04:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703784023] [2024-11-08 16:04:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703784023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:04:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318265602] [2024-11-08 16:04:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:57,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:04:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:04:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:04:57,167 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:04:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:57,274 INFO L93 Difference]: Finished difference Result 252 states and 361 transitions. [2024-11-08 16:04:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:04:57,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-08 16:04:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:57,276 INFO L225 Difference]: With dead ends: 252 [2024-11-08 16:04:57,277 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 16:04:57,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:04:57,278 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:57,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:04:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 16:04:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-08 16:04:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.366412213740458) internal successors, (179), 131 states have internal predecessors, (179), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:04:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2024-11-08 16:04:57,298 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 92 [2024-11-08 16:04:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:57,299 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2024-11-08 16:04:57,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:04:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2024-11-08 16:04:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 16:04:57,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:57,301 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:04:57,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:04:57,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:57,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash -399011582, now seen corresponding path program 1 times [2024-11-08 16:04:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755612904] [2024-11-08 16:04:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:04:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:04:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:04:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:04:59,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:59,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755612904] [2024-11-08 16:04:59,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755612904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:59,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673500431] [2024-11-08 16:04:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:59,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:59,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:59,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:59,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:05:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 16:05:00,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:00,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 16:05:00,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:05:01,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:05:02,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:05:02,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:05:02,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:05:03,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:05:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:05:03,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2024-11-08 16:05:03,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:05:03,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:05:03,615 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2024-11-08 16:05:03,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 80 [2024-11-08 16:05:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:05:03,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:05:03,954 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-08 16:05:03,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 63 [2024-11-08 16:05:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 16:05:05,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:06:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673500431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:10,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:06:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2024-11-08 16:06:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375963283] [2024-11-08 16:06:10,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:06:10,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 16:06:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 16:06:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=531, Unknown=13, NotChecked=0, Total=650 [2024-11-08 16:06:10,993 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 22 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 16:06:31,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:36,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:42,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:47,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:53,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:59,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:07:20,785 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2024-11-08 16:07:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 16:07:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) Word has length 95 [2024-11-08 16:07:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:07:20,792 INFO L225 Difference]: With dead ends: 333 [2024-11-08 16:07:20,792 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 16:07:20,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=365, Invalid=1262, Unknown=13, NotChecked=0, Total=1640 [2024-11-08 16:07:20,801 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 430 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 86 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:07:20,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 886 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1305 Invalid, 6 Unknown, 0 Unchecked, 54.4s Time] [2024-11-08 16:07:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 16:07:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 171. [2024-11-08 16:07:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:07:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2024-11-08 16:07:20,868 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 95 [2024-11-08 16:07:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:07:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2024-11-08 16:07:20,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 16:07:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2024-11-08 16:07:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 16:07:20,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:07:20,876 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:07:20,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:07:21,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 16:07:21,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:07:21,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1595133124, now seen corresponding path program 1 times [2024-11-08 16:07:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558473590] [2024-11-08 16:07:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:07:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:07:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:07:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:07:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:07:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:07:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:07:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:07:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:07:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:07:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558473590] [2024-11-08 16:07:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558473590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:07:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668448996] [2024-11-08 16:07:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:33,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:07:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:07:33,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:07:33,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:07:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:33,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-08 16:07:33,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:07:33,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2024-11-08 16:07:36,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 94 [2024-11-08 16:08:04,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-08 16:08:05,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:05,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2024-11-08 16:08:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:10,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:10,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 16:08:12,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:12,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:08:12,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 16:08:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:08:15,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:08:18,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_667 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_667))) (let ((.cse0 (mod (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (= .cse0 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (< 32767 .cse0) (not (= (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_667 c_~WrapperStruct00_var_1_7_Pointer~0.offset)) v_ArrVal_667)))))) (forall ((v_ArrVal_667 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_667))) (let ((.cse3 (mod (+ (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (< .cse3 32768) (= (+ 65536 (select (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) .cse3) (not (= (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_667 c_~WrapperStruct00_var_1_7_Pointer~0.offset)) v_ArrVal_667)))))))) is different from false [2024-11-08 16:08:19,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_667 (Array Int Int)) (|ULTIMATE.start_step_#t~ite23#1| Int)) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_667))) (let ((.cse0 (mod (+ 65520 (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse0 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (not (= v_ArrVal_667 (store (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_667 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< 32767 .cse0)))))) (forall ((v_ArrVal_667 (Array Int Int)) (|ULTIMATE.start_step_#t~ite23#1| Int)) (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset |ULTIMATE.start_step_#t~ite23#1|)))) (let ((.cse6 (store .cse5 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_667))) (let ((.cse4 (mod (+ 65520 (select (select .cse6 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (< .cse4 32768) (not (= v_ArrVal_667 (store (select .cse5 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_667 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse4 (+ 65536 (select (select .cse6 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))))))))) is different from false [2024-11-08 16:08:27,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:08:29,475 INFO L349 Elim1Store]: treesize reduction 60, result has 50.0 percent of original size [2024-11-08 16:08:29,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 108 [2024-11-08 16:08:29,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 181 treesize of output 189 [2024-11-08 16:08:30,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2024-11-08 16:08:34,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:34,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 307 treesize of output 289 [2024-11-08 16:08:38,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:38,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 515 treesize of output 475 [2024-11-08 16:08:45,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:08:45,029 INFO L224 Elim1Store]: Index analysis took 123 ms [2024-11-08 16:08:46,128 INFO L349 Elim1Store]: treesize reduction 89, result has 25.8 percent of original size [2024-11-08 16:08:46,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 77 [2024-11-08 16:08:46,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 130 [2024-11-08 16:08:47,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-08 16:08:47,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:08:47,268 INFO L224 Elim1Store]: Index analysis took 124 ms [2024-11-08 16:08:48,906 INFO L349 Elim1Store]: treesize reduction 58, result has 50.0 percent of original size [2024-11-08 16:08:48,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 303 treesize of output 104 [2024-11-08 16:08:49,144 INFO L224 Elim1Store]: Index analysis took 110 ms [2024-11-08 16:08:49,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:49,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 171 treesize of output 179 [2024-11-08 16:08:51,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-08 16:08:53,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-08 16:08:54,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 95 treesize of output 91 [2024-11-08 16:08:57,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:57,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 469 treesize of output 439 [2024-11-08 16:09:05,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:05,947 INFO L224 Elim1Store]: Index analysis took 112 ms [2024-11-08 16:09:06,857 INFO L349 Elim1Store]: treesize reduction 87, result has 25.0 percent of original size [2024-11-08 16:09:06,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 305 treesize of output 77 [2024-11-08 16:09:07,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:09:07,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 136 [2024-11-08 16:09:07,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-08 16:09:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:09:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668448996] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:09:24,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:09:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 11] total 30 [2024-11-08 16:09:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624489383] [2024-11-08 16:09:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:09:24,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:09:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:09:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:09:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=671, Unknown=3, NotChecked=106, Total=870 [2024-11-08 16:09:24,569 INFO L87 Difference]: Start difference. First operand 171 states and 237 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:09:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:09:34,884 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2024-11-08 16:09:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:09:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-08 16:09:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:09:34,890 INFO L225 Difference]: With dead ends: 333 [2024-11-08 16:09:34,890 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 16:09:34,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=110, Invalid=825, Unknown=3, NotChecked=118, Total=1056 [2024-11-08 16:09:34,892 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 348 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:09:34,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 476 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 211 Invalid, 0 Unknown, 425 Unchecked, 5.7s Time] [2024-11-08 16:09:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 16:09:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 197. [2024-11-08 16:09:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 174 states have internal predecessors, (236), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:09:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 272 transitions. [2024-11-08 16:09:34,930 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 272 transitions. Word has length 95 [2024-11-08 16:09:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:09:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 272 transitions. [2024-11-08 16:09:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:09:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 272 transitions. [2024-11-08 16:09:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 16:09:34,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:09:34,932 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:09:34,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:09:35,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 16:09:35,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:09:35,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:09:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash 942900805, now seen corresponding path program 1 times [2024-11-08 16:09:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:09:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407918200] [2024-11-08 16:09:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:09:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:09:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:09:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:09:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:09:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:09:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:09:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:09:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:09:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:09:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:09:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:09:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:09:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407918200] [2024-11-08 16:09:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407918200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:09:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:09:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:09:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688459032] [2024-11-08 16:09:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:09:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:09:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:09:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:09:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:09:37,342 INFO L87 Difference]: Start difference. First operand 197 states and 272 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:09:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:09:43,171 INFO L93 Difference]: Finished difference Result 372 states and 519 transitions. [2024-11-08 16:09:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:09:43,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-08 16:09:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:09:43,174 INFO L225 Difference]: With dead ends: 372 [2024-11-08 16:09:43,174 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 16:09:43,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:09:43,175 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 197 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:09:43,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 470 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-08 16:09:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 16:09:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 193. [2024-11-08 16:09:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.3529411764705883) internal successors, (230), 170 states have internal predecessors, (230), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:09:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2024-11-08 16:09:43,208 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 96 [2024-11-08 16:09:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:09:43,208 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2024-11-08 16:09:43,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:09:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2024-11-08 16:09:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 16:09:43,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:09:43,210 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:09:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:09:43,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:09:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:09:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 317701151, now seen corresponding path program 1 times [2024-11-08 16:09:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:09:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461866554] [2024-11-08 16:09:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:09:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:09:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:09:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:09:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:09:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:09:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:09:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:09:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:09:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:09:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:09:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:09:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:09:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461866554] [2024-11-08 16:09:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461866554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:09:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:09:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:09:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631487926] [2024-11-08 16:09:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:09:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:09:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:09:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:09:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:09:51,709 INFO L87 Difference]: Start difference. First operand 193 states and 266 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:10:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:06,496 INFO L93 Difference]: Finished difference Result 418 states and 582 transitions. [2024-11-08 16:10:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:10:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-08 16:10:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:06,499 INFO L225 Difference]: With dead ends: 418 [2024-11-08 16:10:06,499 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 16:10:06,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:10:06,501 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 479 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:06,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 770 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-08 16:10:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 16:10:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 215. [2024-11-08 16:10:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 192 states have internal predecessors, (259), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:10:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 295 transitions. [2024-11-08 16:10:06,549 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 295 transitions. Word has length 97 [2024-11-08 16:10:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:06,549 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 295 transitions. [2024-11-08 16:10:06,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:10:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 295 transitions. [2024-11-08 16:10:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 16:10:06,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:06,552 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:10:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:10:06,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1210360426, now seen corresponding path program 1 times [2024-11-08 16:10:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:10:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127976331] [2024-11-08 16:10:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:10:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:10:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:10:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:10:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:10:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:10:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:10:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:10:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:10:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:10:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:10:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:10:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127976331] [2024-11-08 16:10:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127976331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:10:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:10:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:10:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377604871] [2024-11-08 16:10:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:10:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:10:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:10:12,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:10:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:10:12,933 INFO L87 Difference]: Start difference. First operand 215 states and 295 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:10:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:27,324 INFO L93 Difference]: Finished difference Result 423 states and 587 transitions. [2024-11-08 16:10:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:10:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-08 16:10:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:27,326 INFO L225 Difference]: With dead ends: 423 [2024-11-08 16:10:27,326 INFO L226 Difference]: Without dead ends: 299 [2024-11-08 16:10:27,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:10:27,328 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 229 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:27,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 816 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-11-08 16:10:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-08 16:10:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 211. [2024-11-08 16:10:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 188 states have (on average 1.3404255319148937) internal successors, (252), 188 states have internal predecessors, (252), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:10:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2024-11-08 16:10:27,363 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 97 [2024-11-08 16:10:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:27,363 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2024-11-08 16:10:27,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:10:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2024-11-08 16:10:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 16:10:27,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:27,365 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:10:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:10:27,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1046504286, now seen corresponding path program 1 times [2024-11-08 16:10:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:10:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053226587] [2024-11-08 16:10:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:10:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:10:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:10:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:10:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:10:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:10:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:10:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:10:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:10:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:10:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:10:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:10:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053226587] [2024-11-08 16:10:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053226587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:10:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:10:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:10:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751602069] [2024-11-08 16:10:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:10:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:10:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:10:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:10:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:10:31,189 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:10:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:45,153 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. [2024-11-08 16:10:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:10:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-08 16:10:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:45,156 INFO L225 Difference]: With dead ends: 413 [2024-11-08 16:10:45,156 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 16:10:45,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:10:45,157 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 187 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:45,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 411 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2024-11-08 16:10:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 16:10:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 219. [2024-11-08 16:10:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 196 states have (on average 1.336734693877551) internal successors, (262), 196 states have internal predecessors, (262), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:10:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 298 transitions. [2024-11-08 16:10:45,195 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 298 transitions. Word has length 97 [2024-11-08 16:10:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:45,196 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 298 transitions. [2024-11-08 16:10:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:10:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 298 transitions. [2024-11-08 16:10:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 16:10:45,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:45,198 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:10:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:10:45,199 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1108543900, now seen corresponding path program 1 times [2024-11-08 16:10:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:10:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124435455] [2024-11-08 16:10:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:10:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:10:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:10:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:10:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:10:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:10:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:10:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:10:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:10:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:10:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:10:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:10:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124435455] [2024-11-08 16:10:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124435455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:10:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:10:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:10:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084268078] [2024-11-08 16:10:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:10:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:10:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:10:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:10:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:10:55,407 INFO L87 Difference]: Start difference. First operand 219 states and 298 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 16:11:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:11:18,106 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2024-11-08 16:11:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:11:18,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2024-11-08 16:11:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:11:18,109 INFO L225 Difference]: With dead ends: 413 [2024-11-08 16:11:18,109 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 16:11:18,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:11:18,111 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 175 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:11:18,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 598 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2024-11-08 16:11:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 16:11:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 211. [2024-11-08 16:11:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 188 states have (on average 1.3297872340425532) internal successors, (250), 188 states have internal predecessors, (250), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:11:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 286 transitions. [2024-11-08 16:11:18,151 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 286 transitions. Word has length 97 [2024-11-08 16:11:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:11:18,152 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 286 transitions. [2024-11-08 16:11:18,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 16:11:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 286 transitions. [2024-11-08 16:11:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 16:11:18,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:11:18,154 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:11:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:11:18,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:11:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:11:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1399233237, now seen corresponding path program 1 times [2024-11-08 16:11:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:11:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495498894] [2024-11-08 16:11:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:11:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:11:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:11:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:11:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:11:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:11:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:11:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:11:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:11:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:11:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:11:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:11:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:11:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495498894] [2024-11-08 16:11:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495498894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:11:23,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:11:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:11:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957214943] [2024-11-08 16:11:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:11:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:11:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:11:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:11:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:11:23,124 INFO L87 Difference]: Start difference. First operand 211 states and 286 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 16:11:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:11:31,502 INFO L93 Difference]: Finished difference Result 347 states and 480 transitions. [2024-11-08 16:11:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:11:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 98 [2024-11-08 16:11:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:11:31,505 INFO L225 Difference]: With dead ends: 347 [2024-11-08 16:11:31,505 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 16:11:31,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:11:31,506 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 285 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:11:31,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 418 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-08 16:11:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 16:11:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2024-11-08 16:11:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.324607329842932) internal successors, (253), 191 states have internal predecessors, (253), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:11:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 289 transitions. [2024-11-08 16:11:31,539 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 289 transitions. Word has length 98 [2024-11-08 16:11:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:11:31,539 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 289 transitions. [2024-11-08 16:11:31,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 16:11:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 289 transitions. [2024-11-08 16:11:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 16:11:31,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:11:31,541 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:11:31,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:11:31,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:11:31,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:11:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1090295725, now seen corresponding path program 1 times [2024-11-08 16:11:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:11:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197069651] [2024-11-08 16:11:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:11:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:11:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:11:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:11:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:11:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:11:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:11:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:11:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:11:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:11:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:11:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:11:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:11:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197069651] [2024-11-08 16:11:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197069651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:11:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:11:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:11:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464252370] [2024-11-08 16:11:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:11:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:11:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:11:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:11:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:11:32,041 INFO L87 Difference]: Start difference. First operand 214 states and 289 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:11:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:11:32,211 INFO L93 Difference]: Finished difference Result 316 states and 434 transitions. [2024-11-08 16:11:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:11:32,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 16:11:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:11:32,214 INFO L225 Difference]: With dead ends: 316 [2024-11-08 16:11:32,214 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 16:11:32,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:11:32,216 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:11:32,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:11:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 16:11:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-08 16:11:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:11:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 251 transitions. [2024-11-08 16:11:32,254 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 251 transitions. Word has length 98 [2024-11-08 16:11:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:11:32,254 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 251 transitions. [2024-11-08 16:11:32,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:11:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 251 transitions. [2024-11-08 16:11:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 16:11:32,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:11:32,257 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:11:32,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:11:32,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:11:32,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:11:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1312642950, now seen corresponding path program 1 times [2024-11-08 16:11:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:11:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469810949] [2024-11-08 16:11:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:11:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:11:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:11:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:11:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:11:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:11:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:11:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:11:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:11:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:11:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:11:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:11:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:11:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469810949] [2024-11-08 16:11:43,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469810949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:11:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822301567] [2024-11-08 16:11:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:11:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:11:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:11:43,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:11:43,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:11:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:11:43,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 16:11:43,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:11:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 16:12:07,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:12:16,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:12:16,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:12:17,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2024-11-08 16:12:17,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:12:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:12:17,739 INFO L224 Elim1Store]: Index analysis took 103 ms [2024-11-08 16:12:18,089 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2024-11-08 16:12:18,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 80 [2024-11-08 16:12:18,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:12:18,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2024-11-08 16:12:28,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:12:28,348 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 91 treesize of output 103 [2024-11-08 16:12:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 16:12:30,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:12:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822301567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:12:58,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:12:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-11-08 16:12:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818469571] [2024-11-08 16:12:58,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:12:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 16:12:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:12:58,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 16:12:58,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=709, Unknown=1, NotChecked=0, Total=812 [2024-11-08 16:12:58,325 INFO L87 Difference]: Start difference. First operand 188 states and 251 transitions. Second operand has 24 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 22 states have internal predecessors, (104), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 16:13:24,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:13:30,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:13:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:48,949 INFO L93 Difference]: Finished difference Result 358 states and 480 transitions. [2024-11-08 16:13:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 16:13:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 22 states have internal predecessors, (104), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 99 [2024-11-08 16:13:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:48,951 INFO L225 Difference]: With dead ends: 358 [2024-11-08 16:13:48,952 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 16:13:48,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=379, Invalid=1600, Unknown=1, NotChecked=0, Total=1980 [2024-11-08 16:13:48,954 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 450 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 158 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:48,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 784 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1100 Invalid, 2 Unknown, 0 Unchecked, 33.8s Time] [2024-11-08 16:13:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 16:13:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 198. [2024-11-08 16:13:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.283236994219653) internal successors, (222), 173 states have internal predecessors, (222), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:13:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 258 transitions. [2024-11-08 16:13:49,004 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 258 transitions. Word has length 99 [2024-11-08 16:13:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:49,004 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 258 transitions. [2024-11-08 16:13:49,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 22 states have internal predecessors, (104), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 16:13:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2024-11-08 16:13:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 16:13:49,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:49,006 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:13:49,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:13:49,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 16:13:49,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1670963071, now seen corresponding path program 1 times [2024-11-08 16:13:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003327181] [2024-11-08 16:13:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:49,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:13:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:49,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:13:49,500 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:13:49,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:13:49,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:13:49,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:49,630 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:13:49,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:13:49 BoogieIcfgContainer [2024-11-08 16:13:49,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:13:49,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:13:49,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:13:49,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:13:49,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:50" (3/4) ... [2024-11-08 16:13:49,638 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:13:49,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:13:49,640 INFO L158 Benchmark]: Toolchain (without parser) took 540996.76ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 130.9MB in the beginning and 145.1MB in the end (delta: -14.1MB). Peak memory consumption was 236.5MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,640 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 115.3MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:13:49,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.36ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 125.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.26ms. Allocated memory is still 165.7MB. Free memory was 125.3MB in the beginning and 121.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,641 INFO L158 Benchmark]: Boogie Preprocessor took 80.23ms. Allocated memory is still 165.7MB. Free memory was 121.1MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,641 INFO L158 Benchmark]: RCFGBuilder took 1012.86ms. Allocated memory is still 165.7MB. Free memory was 118.1MB in the beginning and 82.4MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,642 INFO L158 Benchmark]: TraceAbstraction took 539345.61ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 81.3MB in the beginning and 145.1MB in the end (delta: -63.8MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-11-08 16:13:49,642 INFO L158 Benchmark]: Witness Printer took 5.34ms. Allocated memory is still 415.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:13:49,643 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.30ms. Allocated memory is still 115.3MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.36ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 125.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.26ms. Allocated memory is still 165.7MB. Free memory was 125.3MB in the beginning and 121.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.23ms. Allocated memory is still 165.7MB. Free memory was 121.1MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.86ms. Allocated memory is still 165.7MB. Free memory was 118.1MB in the beginning and 82.4MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 539345.61ms. Allocated memory was 165.7MB in the beginning and 415.2MB in the end (delta: 249.6MB). Free memory was 81.3MB in the beginning and 145.1MB in the end (delta: -63.8MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 5.34ms. Allocated memory is still 415.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 112, overapproximation of bitwiseAnd at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -5, 0, 256, 44772, 5.9, 7.6, 64.2, 128.75, 8, 3135928546 }; [L47] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L49] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L50] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L55] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L56] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L57] signed short int last_1_WrapperStruct00_var_1_1 = -5; [L58] unsigned long int last_1_WrapperStruct00_var_1_11 = 8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=0, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L108] EXPR WrapperStruct00.var_1_1 [L108] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_11 [L109] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L98] EXPR (WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L100] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L120] RET updateVariables() [L121] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_1; [L63] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L63] COND TRUE (*(WrapperStruct00_var_1_4_Pointer)) [L64] (*(WrapperStruct00_var_1_5_Pointer)) = last_1_WrapperStruct00_var_1_1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L70] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L71] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_5_Pointer)) + -16) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L77] EXPR (*(WrapperStruct00_var_1_5_Pointer)) & last_1_WrapperStruct00_var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L77] COND TRUE last_1_WrapperStruct00_var_1_11 >= ((*(WrapperStruct00_var_1_5_Pointer)) & last_1_WrapperStruct00_var_1_11) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) < (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11)) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) < (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L78] (*(WrapperStruct00_var_1_11_Pointer)) = ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) < (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11)))) [L86] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L86] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L87] (*(WrapperStruct00_var_1_7_Pointer)) = (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) [L112] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L112] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1)) [L112] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1) [L112] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L112] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1))) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1) [L112] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1 [L112] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L112] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L112] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1))) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112] EXPR (((((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1))) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= ((*(WrapperStruct00_var_1_5_Pointer)) & last_1_WrapperStruct00_var_1_11)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) < (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L112-L113] return (((((*(WrapperStruct00_var_1_5_Pointer)) == (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_5_Pointer)) + -16))) : ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > (((*(WrapperStruct00_var_1_6_Pointer)) - 8))) ? (last_1_WrapperStruct00_var_1_11) : (((*(WrapperStruct00_var_1_6_Pointer)) - 8)))))) : 1))) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_5_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((10.25f + (*(WrapperStruct00_var_1_8_Pointer))) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= ((*(WrapperStruct00_var_1_5_Pointer)) & last_1_WrapperStruct00_var_1_11)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) < (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : (((*(WrapperStruct00_var_1_12_Pointer)) - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 539.1s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 213.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 3333 SdHoareTripleChecker+Valid, 163.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3332 mSDsluCounter, 7709 SdHoareTripleChecker+Invalid, 161.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 425 IncrementalHoareTripleChecker+Unchecked, 6063 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6633 IncrementalHoareTripleChecker+Invalid, 7562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 1646 mSDtfsCounter, 6633 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 724 SyntacticMatches, 3 SemanticMatches, 207 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 180.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 752 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 321.7s InterpolantComputationTime, 1812 NumberOfCodeBlocks, 1812 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1787 ConstructedInterpolants, 26 QuantifiedInterpolants, 26422 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1244 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 2561/2736 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-11-08 16:13:49,861 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 16:13:49,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX --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 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:13:52,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:13:52,768 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:13:52,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:13:52,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:13:52,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:13:52,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:13:52,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:13:52,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:13:52,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:13:52,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:13:52,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:13:52,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:13:52,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:13:52,856 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:13:52,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:13:52,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:13:52,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:13:52,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:13:52,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:13:52,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:13:52,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:13:52,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:13:52,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:13:52,867 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:13:52,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:13:52,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:13:52,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:13:52,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:13:52,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:13:52,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:13:52,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:13:52,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:13:52,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:13:52,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:52,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:13:52,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:13:52,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:13:52,875 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:13:52,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:13:52,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:13:52,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:13:52,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:13:52,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:13:52,878 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX 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 -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2024-11-08 16:13:53,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:13:53,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:13:53,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:13:53,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:13:53,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:13:53,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i Unable to find full path for "g++" [2024-11-08 16:13:55,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:13:56,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:13:56,022 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-08 16:13:56,033 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/a9b336de2/369cfd1177af47cc851ecfdf8ac7aa7b/FLAGa41e6d77e [2024-11-08 16:13:56,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/data/a9b336de2/369cfd1177af47cc851ecfdf8ac7aa7b [2024-11-08 16:13:56,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:13:56,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:13:56,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:56,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:13:56,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:13:56,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0613ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56, skipping insertion in model container [2024-11-08 16:13:56,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:13:56,403 WARN L250 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-11-08 16:13:56,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:56,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:13:56,554 WARN L250 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_03d987f3-7e5b-4cb5-b992-4b8bba47f493/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-11-08 16:13:56,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:56,715 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:13:56,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56 WrapperNode [2024-11-08 16:13:56,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:56,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:56,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:13:56,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:13:56,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,825 INFO L138 Inliner]: procedures = 37, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2024-11-08 16:13:56,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:56,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:13:56,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:13:56,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:13:56,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,905 INFO L175 MemorySlicer]: Split 97 memory accesses to 2 slices as follows [2, 95]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-08 16:13:56,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:13:56,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:13:56,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:13:56,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:13:56,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (1/1) ... [2024-11-08 16:13:56,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:13:57,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:13:57,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:13:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:13:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:13:57,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:13:57,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:13:57,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:13:57,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:13:57,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:13:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:13:57,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:13:57,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:13:57,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:13:57,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:14:00,386 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-08 16:14:00,386 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:14:00,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:14:00,402 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:14:00,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:14:00 BoogieIcfgContainer [2024-11-08 16:14:00,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:14:00,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:14:00,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:14:00,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:14:00,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:13:56" (1/3) ... [2024-11-08 16:14:00,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a7f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:14:00, skipping insertion in model container [2024-11-08 16:14:00,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:56" (2/3) ... [2024-11-08 16:14:00,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a7f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:14:00, skipping insertion in model container [2024-11-08 16:14:00,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:14:00" (3/3) ... [2024-11-08 16:14:00,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2024-11-08 16:14:00,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:14:00,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:14:00,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:14:00,535 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;@4cf42dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:14:00,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:14:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:14:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 16:14:00,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:00,555 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:00,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:00,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1625780518, now seen corresponding path program 1 times [2024-11-08 16:14:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496498692] [2024-11-08 16:14:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:00,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:00,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:00,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:00,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:14:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:01,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:14:01,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 16:14:01,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:01,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496498692] [2024-11-08 16:14:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496498692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:14:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137667612] [2024-11-08 16:14:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:01,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:14:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:14:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:14:01,367 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:14:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:01,414 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-08 16:14:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:14:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-08 16:14:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:01,430 INFO L225 Difference]: With dead ends: 188 [2024-11-08 16:14:01,431 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:14:01,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-11-08 16:14:01,444 INFO L432 NwaCegarLoop]: 129 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, 129 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-11-08 16:14:01,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:14:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:14:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:14:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:14:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-08 16:14:01,503 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-08 16:14:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-08 16:14:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 16:14:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-08 16:14:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 16:14:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:01,509 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:01,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:01,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:01,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2071485527, now seen corresponding path program 1 times [2024-11-08 16:14:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626505152] [2024-11-08 16:14:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:01,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:01,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:14:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:02,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 16:14:02,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:02,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-08 16:14:03,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2024-11-08 16:14:08,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 16:14:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-08 16:14:08,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-11-08 16:14:09,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-11-08 16:14:09,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:09,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 48 [2024-11-08 16:14:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:14:09,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:09,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626505152] [2024-11-08 16:14:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626505152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:14:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21405605] [2024-11-08 16:14:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:14:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:14:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:14:09,496 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:15,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:19,529 INFO L93 Difference]: Finished difference Result 364 states and 508 transitions. [2024-11-08 16:14:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:14:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-08 16:14:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:19,533 INFO L225 Difference]: With dead ends: 364 [2024-11-08 16:14:19,533 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 16:14:19,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:14:19,538 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 393 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:19,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-08 16:14:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 16:14:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 149. [2024-11-08 16:14:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:14:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2024-11-08 16:14:19,578 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 92 [2024-11-08 16:14:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:19,579 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2024-11-08 16:14:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2024-11-08 16:14:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:14:19,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:19,582 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:19,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:19,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:19,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1613667496, now seen corresponding path program 1 times [2024-11-08 16:14:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759142007] [2024-11-08 16:14:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:19,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:19,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:14:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:20,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:14:20,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:20,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:14:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:14:20,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:20,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759142007] [2024-11-08 16:14:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759142007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:20,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:14:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950296022] [2024-11-08 16:14:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:14:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:14:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:20,343 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:20,383 INFO L93 Difference]: Finished difference Result 237 states and 334 transitions. [2024-11-08 16:14:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:14:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-08 16:14:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:20,386 INFO L225 Difference]: With dead ends: 237 [2024-11-08 16:14:20,387 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 16:14:20,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:20,389 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:20,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:14:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 16:14:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-08 16:14:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 127 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:14:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 206 transitions. [2024-11-08 16:14:20,433 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 206 transitions. Word has length 93 [2024-11-08 16:14:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:20,434 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 206 transitions. [2024-11-08 16:14:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 206 transitions. [2024-11-08 16:14:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 16:14:20,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:20,440 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:20,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:20,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 601349620, now seen corresponding path program 1 times [2024-11-08 16:14:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370715220] [2024-11-08 16:14:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:20,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:20,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:20,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:20,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:14:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:21,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:14:21,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:14:21,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:21,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370715220] [2024-11-08 16:14:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370715220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:14:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867317083] [2024-11-08 16:14:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:14:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:21,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:14:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:21,137 INFO L87 Difference]: Start difference. First operand 148 states and 206 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:21,514 INFO L93 Difference]: Finished difference Result 249 states and 346 transitions. [2024-11-08 16:14:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:14:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-08 16:14:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:21,518 INFO L225 Difference]: With dead ends: 249 [2024-11-08 16:14:21,518 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 16:14:21,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:21,520 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 17 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:21,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:14:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 16:14:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2024-11-08 16:14:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.330708661417323) internal successors, (169), 127 states have internal predecessors, (169), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:14:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 205 transitions. [2024-11-08 16:14:21,541 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 205 transitions. Word has length 93 [2024-11-08 16:14:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 205 transitions. [2024-11-08 16:14:21,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 205 transitions. [2024-11-08 16:14:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 16:14:21,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:21,544 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:21,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:14:21,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:21,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash 974019140, now seen corresponding path program 1 times [2024-11-08 16:14:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171721478] [2024-11-08 16:14:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:21,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:21,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:21,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:14:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:22,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 16:14:22,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:22,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-08 16:14:23,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2024-11-08 16:14:26,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:14:26,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 16:14:27,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 16:14:27,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:27,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 16:14:27,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 45 [2024-11-08 16:14:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:14:27,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:27,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171721478] [2024-11-08 16:14:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171721478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:27,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:14:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227472415] [2024-11-08 16:14:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:27,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:14:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:27,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:14:27,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:14:27,714 INFO L87 Difference]: Start difference. First operand 148 states and 205 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:32,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:36,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:37,280 INFO L93 Difference]: Finished difference Result 318 states and 436 transitions. [2024-11-08 16:14:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:14:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-08 16:14:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:37,284 INFO L225 Difference]: With dead ends: 318 [2024-11-08 16:14:37,284 INFO L226 Difference]: Without dead ends: 230 [2024-11-08 16:14:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:14:37,289 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 301 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:37,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 597 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-08 16:14:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-08 16:14:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2024-11-08 16:14:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 135 states have internal predecessors, (180), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:14:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 216 transitions. [2024-11-08 16:14:37,317 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 216 transitions. Word has length 94 [2024-11-08 16:14:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:37,318 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 216 transitions. [2024-11-08 16:14:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 216 transitions. [2024-11-08 16:14:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 16:14:37,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:37,324 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:37,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:37,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:37,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:37,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1866678415, now seen corresponding path program 1 times [2024-11-08 16:14:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917910619] [2024-11-08 16:14:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:37,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:37,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:37,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:14:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:37,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:14:37,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:38,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:14:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:14:38,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:38,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917910619] [2024-11-08 16:14:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917910619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:14:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714875345] [2024-11-08 16:14:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:14:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:38,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:14:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:38,040 INFO L87 Difference]: Start difference. First operand 156 states and 216 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:38,074 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2024-11-08 16:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:14:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-08 16:14:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:38,077 INFO L225 Difference]: With dead ends: 246 [2024-11-08 16:14:38,077 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 16:14:38,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:14:38,079 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:38,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:14:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 16:14:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-08 16:14:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:14:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2024-11-08 16:14:38,095 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 94 [2024-11-08 16:14:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:38,096 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2024-11-08 16:14:38,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:14:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2024-11-08 16:14:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 16:14:38,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:38,098 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:14:38,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 16:14:38,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:38,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:38,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1479985167, now seen corresponding path program 1 times [2024-11-08 16:14:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804972008] [2024-11-08 16:14:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:38,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:38,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:38,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:38,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:14:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:38,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:14:38,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:38,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 16:14:39,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 16:14:39,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:14:39,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:14:40,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:14:40,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:14:40,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:14:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:14:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 16:14:40,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:14:41,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804972008] [2024-11-08 16:14:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804972008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:14:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069484968] [2024-11-08 16:14:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:41,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:14:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:14:41,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:14:41,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 16:14:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:41,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 16:14:41,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:41,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2024-11-08 16:14:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:14:45,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:14:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 16:14:46,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 16:14:46,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-08 16:14:46,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:46,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 47 [2024-11-08 16:14:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 16:14:46,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:16:48,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34030 treesize of output 31982 [2024-11-08 16:17:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 16:17:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069484968] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:17:51,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:17:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 12] total 27 [2024-11-08 16:17:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603225668] [2024-11-08 16:17:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:17:51,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:17:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:17:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:17:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2024-11-08 16:17:51,849 INFO L87 Difference]: Start difference. First operand 150 states and 205 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:18:01,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:18:04,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:18:06,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:18:09,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:18:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:18:09,984 INFO L93 Difference]: Finished difference Result 236 states and 323 transitions. [2024-11-08 16:18:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:18:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-08 16:18:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:18:09,988 INFO L225 Difference]: With dead ends: 236 [2024-11-08 16:18:09,988 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 16:18:09,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2024-11-08 16:18:09,991 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 200 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:18:09,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 287 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 15.9s Time] [2024-11-08 16:18:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 16:18:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-08 16:18:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:18:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2024-11-08 16:18:10,015 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 95 [2024-11-08 16:18:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:18:10,016 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2024-11-08 16:18:10,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 16:18:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2024-11-08 16:18:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 16:18:10,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:18:10,019 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:18:10,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 16:18:10,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:18:10,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:18:10,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:18:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:18:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 452410847, now seen corresponding path program 1 times [2024-11-08 16:18:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:18:10,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519235117] [2024-11-08 16:18:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:18:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:18:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:18:10,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:18:10,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d987f3-7e5b-4cb5-b992-4b8bba47f493/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process